Fair Robust Predictive Resource Allocation for Video Streaming under Rate Uncertainties
Bibliographic record
Abstract
Predictive Resource Allocation (PRA) has demonstrated its ability to provide smooth video delivery with minimal and fair interruptions. Recent work on PRA techniques exploited rate predictions to strategically allocate the limited radio resources for delivering video content. However, existing PRA techniques assume perfect prediction of future information in order to define the maximum attainable gains. In this paper, we introduce a probabilistic robust PRA framework that handles prediction errors. By adopting chance constraint programming we were able to define a probabilistic measure on the QoS degradation due to prediction uncertainties. A deterministic non-convex formulation is then obtained using the statistical parameters of predicted rates. Accordingly, we propose a convex approximation to the formulated fair PRA, which can be solved using optimal solvers to obtain a benchmark solution for future robust PRA schemes. We evaluate non-PRA and non-robust PRA schemes considering typical error models of the predicted rates. We found these schemes to result in suboptimal fairness and increased QoS degradations with the network load. Results further reveal the ability of the introduced robust fair PRA to reach the optimal and fair QoS satisfaction levels. Our approach provides a step towards applying PRA in future wireless networks to deliver video streaming content.
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.002 | 0.005 |
| 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.001 | 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".