The DOI matches its Crossref record.
On the predictability of large transfer TCP throughput
Abstract
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throughput predictors. We first classify TCP throughput prediction techniques into two categories: Formula-Based (FB) and History-Based (HB). Within each class, we develop representative prediction algorithms, which we then evaluate empirically over the RON testbed. FB prediction relies on mathematical models that express the TCP throughput as a function of the characteristics of the underlying network path. It does not rely on previous TCP transfers in the given path, and it can be performed with non-intrusive network measurements. We show, however, that the FB method is accurate only if the TCP transfer is window-limited to the point that it does not saturate the underlying path, and explain the main causes of the prediction errors. HB techniques predict the throughput of TCP flows from a time series of previous TCP throughput measurements on the same path, when such a history is available. We show that even simple HB predictors, such as Moving Average and Holt-Winters, using a history of few and sporadic samples, can be quite accurate. On the negative side, HB predictors are highly path-dependent. We explain the cause of such path dependencies based on two key factors: the load on the path and the degree of statistical multiplexing.
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
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
iPlane: an information plane for distributed services
Madhyastha, H. V., Isdal, T., Piatek, M., Dixon, C., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2006) · doi:10.5555/1298455.1298490 · Cited by 526
CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction
Sun, Y., Yin, X., Jiang, J., Sekar, V., Lin, F., Wang, N., Liu, T., & Sinopoli, B. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934898 · Cited by 407
A Control-Theoretic Approach for Dynamic Adaptive Video Streaming over HTTP
Yin, X., Jindal, A., Sekar, V., & Sinopoli, B. (2015) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2829988.2787486 · Cited by 376
Towards agile and smooth video adaptation in dynamic HTTP streaming
Tian, G., & Liu, Y. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413190 · Cited by 288
Metadata
- Authors
- He, Q., Dovrolis, C., & Ammar, M.
- Venue
- Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2005-08-22
- Pages
- 145-156
- OpenAlex
- W2069291311
- Cited by
- 161
- References
- 0
- FWCI
- 8.08
- 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: On the predictability of large transfer TCP throughput. https://app.cochat.ai/papers/10.1145/1080091.1080110
- The paper
- He, Q., Dovrolis, C., & Ammar, M. (2005). On the predictability of large transfer TCP throughput. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/1080091.1080110
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.