Joint Chance-Constrained Predictive Resource Allocation for Energy-Efficient Video Streaming
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Predictive resource allocation (PRA) techniques that exploit knowledge of the future signal strength along roads have recently been recognized as promising approaches to save base station (BS) energy and improve user quality of service (QoS). Recent studies on human mobility patterns and wireless signal strength measurements along buses and trains have indeed supported the practical potential of PRA. An unresolved challenge, however, is modeling the uncertainty in the predictions, and developing real-time robust solutions that incorporate probabilistic QoS guarantees. This is of paramount importance in PRA due to the prediction time horizon that adds considerable complexity and increases the rate uncertainty in the problem. With these developments in mind, this paper addresses energy-efficient PRA applied to stored video streaming using chance constrained programming. The proposed solution incorporates: 1) uncertainty in predicted user rates; 2) a joint level of probabilistic constraint satisfaction over a time horizon; and 3) both optimal gradient-based and real-time guided heuristic solutions. Our framework fundamentally differs from previous PRA work in the literature where nonstochastic approaches with assumptions of perfect prediction were primarily used to demonstrate the potential energy savings and QoS gains. Numerical simulations based on a standard compliant long term evolution (LTE) system are provided to examine and compare the developed solution. Unlike existing energy-efficient PRA, the proposed framework achieves the desired QoS level under imperfect channel predictions. This robustness is attained without compromising the energy-efficiency compared to opportunistic schedulers, and thus supports PRA implementation in practice.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it