The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Modeling TCP throughput: a simple model and its empirical validation
Abstract
In this paper we develop a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send. Unlike the models in [6, 7, 10], our model captures not only the behavior of TCP's fast retransmit mechanism (which is also considered in [6, 7, 10]) but also the effect of TCP's timeout mechanism on throughput. Our measurements suggest that this latter behavior is important from a modeling perspective, as almost all of our TCP traces contained more time-out events than fast retransmit events. Our measurements demonstrate that our model is able to more accurately predict TCP throughput and is accurate over a wider range of loss rates.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Applied Probability Models with Optimization Applications.
Gani, J., & Ross, S. M. (1971) · Journal of the American Statistical Association · doi:10.2307/2284258 · Cited by 2,195
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
Simulation-based comparisons of Tahoe, Reno and SACK TCP
Fall, K., & Floyd, S. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235162 · Cited by 1,148
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Stevens, W. (1997) · doi:10.17487/rfc2001 · Cited by 1,143
Wide-area Internet traffic patterns and characteristics
Thompson, K., Miller, G. J., & Wilder, R. (1997) · IEEE Network · doi:10.1109/65.642356 · Cited by 1,074
Stevens, W. R. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 756
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
TCP-like congestion control for layered multicast data transfer
Vicisano, L., Crowcroft, J., & Rizzo, L. (2002) · doi:10.1109/infcom.1998.662909 · Cited by 522
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205455 · Cited by 323
Cited by
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Online selection of discriminative tracking features
Collins, R. T., Liu, Y., & Leordeanu, M. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.205 · Cited by 1,208
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet
Rejaie, R., Handley, M., & Estrin, D. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752152 · Cited by 710
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347397 · Cited by 587
Self-citation
Metadata
- Authors
- Padhye, J., Firoiu, V., Towsley, D., & Kurose, J.
- Venue
- Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 1998-10
- Pages
- 303-314
- OpenAlex
- W2124478678
- Cited by
- 2,106
- References
- 10
- FWCI
- 62.36
- 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
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.
