Cache-Enabled Adaptive Video Streaming Over Vehicular Networks: A Dynamic Approach
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
Adaptive bitrate (ABR) streaming has recently been deployed in vehicular networks (VNs) to deal with the time-varying channels due to reasons such as high user mobility. Caching at the wireless edge (e.g., base station) to support ABR streaming is a challenging problem. In this paper, we propose a two time-scale dynamic caching scheme for ABR streaming in VNs, in which the video quality adaptation at the application layer and cache placement at the BS are performed at a larger time-scale while the video data transmission at the physical layer is performed at a smaller time-scale. Lyapunov optimization technique is employed to maximize the time-averaged network reward, which is the weighted sum of video quality and backhaul saving. Without the prior knowledge of channel statistics, we develop a dynamic cache algorithm (DCA) to obtain the video quality adaptation, cache placement, and radio bandwidth allocation decisions. For the arbitrary sample path of channel states, we compare the network reward achieved by DCA with that achieved by an optimal T-slot lookahead algorithm, i.e., the knowledge of the future channel path over an interval of length T time slots. Simulation results demonstrate the advantages of DCA for ABR streaming in time-varying VNs over the static cache approach.
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.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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 it