The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
What happens when HTTP adaptive streaming players compete for bandwidth?
Abstract
With an increasing demand for high-quality video content over the Internet, it is becoming more likely that two or more adaptive streaming players share the same network bottleneck and compete for available bandwidth. This competition can lead to three performance problems: player instability, unfairness between players, and bandwidth underutilization. However, the dynamics of such competition and the root cause for the previous three problems are not yet well understood. In this paper, we focus on the problem of competing video players and describe how the typical behavior of an adaptive streaming player in its Steady-State, which includes periods of activity followed by periods of inactivity (ON-OFF periods), is the main root cause behind the problems listed above. We use two adaptive players to experimentally showcase these issues. Then, focusing on the issue of player instability, we test how several factors (the ON-OFF durations, the available bandwidth and its relation to available bitrates, and the number of competing players) affect stability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dummynet: a simple approach to the evaluation of network protocols
Rizzo, L. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/251007.251012 · Cited by 888
An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP
Akhshabi, S., Begen, A. C., & Dovrolis, C. (2011) · Proceedings of the second annual ACM conference on Multimedia systems · doi:10.1145/1943552.1943574 · Cited by 608
Self-citationShaping HTTP adaptive streams for a better user experience
Houdaille, R., & Gouache, S. (2012) · ACM Multimedia Systems Conference (MMSys) · doi:10.1145/2155555.2155557 · Cited by 136
An experimental evaluation of rate-adaptive video players over HTTP
Akhshabi, S., Narayanaswamy, S., Begen, A. C., & Dovrolis, C. (2011) · Signal Processing Image Communication · doi:10.1016/j.image.2011.10.003 · Cited by 130
Self-citation
Cited by
A Control-Theoretic Approach for Dynamic Adaptive Video Streaming over HTTP
Yin, X., Jindal, A., Sekar, V., & Sinopoli, B. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787486 · Cited by 1,016
A Survey on Quality of Experience of HTTP Adaptive Streaming
Seufert, M., Egger, S., Slanina, M., Zinner, T., Hoßfeld, T., & Tran-Gia, P. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2360940 · Cited by 844
Improving fairness, efficiency, and stability in HTTP-based adaptive video streaming with FESTIVE
Jiang, J., Sekar, V., & Zhang, H. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413189 · Cited by 688
Probe and Adapt: Rate Adaptation for HTTP Video Streaming At Scale
Li, Z., Zhu, X., Gahm, J., Pan, R., Hu, H., Begen, A. C., & Oran, D. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.140405 · Cited by 613
Self-citationA Survey on Bitrate Adaptation Schemes for Streaming Media Over HTTP
Bentaleb, A., Taani, B., Begen, A. C., Timmerer, C., & Zimmermann, R. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2862938 · Cited by 494
Self-citation
Metadata
- Authors
- Akhshabi, S., Anantakrishnan, L., Begen, A. C., & Dovrolis, C.
- Venue
- Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
- Publisher
- ACM
- Published
- 2012-06-07
- Pages
- 9-14
- OpenAlex
- W2130954326
- Cited by
- 342
- References
- 4
- FWCI
- 28.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: What happens when HTTP adaptive streaming players compete for bandwidth? https://app.cochat.ai/papers/10.1145/2229087.2229092
- The paper
- Akhshabi, S., Anantakrishnan, L., Begen, A. C., & Dovrolis, C. (2012). What happens when HTTP adaptive streaming players compete for bandwidth? Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video. https://doi.org/10.1145/2229087.2229092
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.