Robust Long-Term Predictive Adaptive Video Streaming Under Wireless Network Uncertainties
Bibliographic record
Abstract
Recent research on predictive video delivery promised optimal resource utilization and quality of service (QoS) satisfaction to both dynamic adaptive streaming over HTTP (DASH) providers and mobile users. These gains were attained while presuming an idealistic environment with perfect predictions. Thus, a robust QoS-aware predictive-DASH (P-DASH) is of paramount importance to handling the practical uncertainty implied in predicted information. In this paper, we propose a stochastic QoS-aware robust predictive-DASH (RP-DASH) scheme over future wireless networks that takes into account imperfect rate predictions. The objective is to achieve long-term quality fairness among the DASH users while capping the probability of service degradation by an operator predefined level. A deterministic formulation is then obtained using the scenario approximation, which adopts the probability density function (PDF) of predicted rates. A linear conservative approximation is introduced to provide an NP-complete formulation, which can be optimized by commercial solvers. Since exact PDF might not be available, Gaussian approximation is adopted by the introduced scheme to provide a closed form less complexity formulation. To support real-time implementations, a guided heuristic algorithm is devised to obtain near-optimal resource allocations and quality selections, while satisfying the predefined QoS level. Previous non-robust P-DASH schemes are evaluated in this paper, while considering typical error models in predicted rates. Such schemes resulted in increased QoS and the quality of experience degradations with the network load, which was avoided by the introduced RP-DASH. Results further revealed the ability of RP-DASH to reach optimal and fair QoS satisfactions.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".