An Application-Driven MAC-layer Buffer Management with Active Dropping for Real-time Video Streaming in 802.16 Networks
Bibliographic record
Abstract
In this paper, we propose an application-driven MAC-layer buffer management framework based on a novel active dropping (AD) mechanism for real-time video streaming in IEEE 802.16 Point-to-Multi-Point (PMP) networks. The basic idea of the proposed approach is that the MAC-layer protocol data units (MPDUs) of a video stream could be actively dropped at the Base Station (BS) if the corresponding frame is not with a sufficient confidence to be successfully delivered to the recipient within its application-layer delay bound. In contrast to the conventional cross-layer techniques that manipulate transmission and/or retransmission priorities for sending MPDUs of a single stream, the proposed AD mechanism can be more effectively bound the delay of each video frame and release precious transmission resources for the subsequent frames or the frames of the other competing streams. This is considered as an intelligent approach for minimizing delay propagation due to bad channels or any other possible reason. A comprehensive analytical model is formulated on deriving how confident a frame can be effectively delivered within its application-layer delay bound by jointly considering the effect of playback buffering. Extensive simulation is performed to demonstrate the effectiveness of the proposed scheme. We expect that the proposed application-driven MAC-layer buffer management can incorporate with the emerging cross-layer design paradigm for real-time video streaming in TDMA-based wireless broadband access networks such as IEEE 802.16.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".