Lower bounds on average-case delay for video-on-demand broadcast protocols
Bibliographic record
Abstract
Video-on-demand broadcast protocols are commonly used to deliver video content to a large uncoordinated set of consumers. Since broadcast protocols are not attuned to individual user requests, some delay in service is unavoidable. The worst-case delay, expressed as a function of the available bandwidth, has been well studied; matching upper and lower bounds have been established in a very general setting. In this paper we turn our attention to average-case delay. We establish asymptotically tight lower bounds on average-case delay in the situation where receiver and sender bandwidths are equal. It follows from our results that existing worst-case-optimal broadcast protocols are, to within a small constant factor, optimal in the average case as well.
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.013 | 0.075 |
| Meta-epidemiology (narrow) | 0.006 | 0.002 |
| Meta-epidemiology (broad) | 0.005 | 0.002 |
| Bibliometrics | 0.007 | 0.007 |
| Science and technology studies | 0.004 | 0.005 |
| Scholarly communication | 0.010 | 0.019 |
| Open science | 0.007 | 0.006 |
| Research integrity | 0.004 | 0.011 |
| Insufficient payload (model declined to judge) | 0.009 | 0.003 |
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".