Closed-Loop Clustering-Based Global Bandwidth Prediction in Real-Time Video Streaming
Bibliographic record
Abstract
Accurate throughput forecasting is essential for ensuring the seamless operation of Real-Time Communication (RTC) applications. These demands for accurate throughput forecasting become particularly challenging when dealing with wireless access links, as they inherently exhibit fluctuating bandwidth. Ensuring an exceptional user Quality of Experience (QoE) in this scenario depends on accurately predicting available bandwidth in the short term since it plays a pivotal role in guiding video rate adaptation. Yet, current methodologies for short-term bandwidth prediction (SBP) struggle to perform adequately in dynamically changing real-world network environments and lack generalizability to adapt across varied network conditions. Also, acquiring long and representative traces that capture real-world network complexity is challenging. To overcome these challenges, we propose closed-loop clustering-based Global Forecasting Models (GFMs) for SBP. Unlike local models, GFMs apply the same function to all traces enabling cross-learning, and leveraging relationships among traces to address the performance issues seen in current SBP algorithms. To address potential heterogeneity within the data and improve prediction quality, a clustered-wise GFM is utilized to group similar traces based on prediction accuracy. Finally, the proposed method is validated using real-world datasets of HSDPA 3G, NYC LTE, and Irish 5G data demonstrating significant improvements in accuracy and generalizability.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".