The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Abstract
Modern implementations of TCP contain four intertwined algorithms that have never been fully documented as Internet standards: slow start, congestion avoidance, fast retransmit, and fast recovery. [2] and [3] provide some details on these algorithms, [4] provides examples of the algorithms in action, and [5] provides the source code for the 4.4BSD implementation. RFC 1122 requires that a TCP must implement slow start and congestion avoidance (Section 4.2.2.15 of [1]), citing [2] as the reference, but fast retransmit and fast recovery were implemented after RFC 1122. The purpose of this document is to document these four algorithms for the Internet.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Requirements for Internet Hosts - Communication Layers
(1989) · doi:10.17487/rfc1122 · Cited by 1,370
Cited by
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285291 · Cited by 2,106
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
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
Modeling TCP Reno performance: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D. F., & Kurose, J. F. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842137 · Cited by 1,184
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · ACM SIGCOMM Computer Communication Review · doi:10.1145/285243.285291 · Cited by 716
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
TCP Hybla: a TCP enhancement for heterogeneous networks
Caini, C., & Firrincieli, R. (2004) · International Journal of Satellite Communications and Networking · doi:10.1002/sat.799 · Cited by 409
Packet reordering is not pathological network behavior
Bennett, J. C. R., Partridge, C., & Shectman, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811445 · Cited by 402
Analytic evaluation of RED performance
Bonald, T., May, M., & Bolot, J.-C. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832539 · Cited by 405
Enhancing TCP Over Satellite Channels using Standard Mechanisms
Allman, M., Glover, D., & Sanchez, L. (1999) · doi:10.17487/rfc2488 · Cited by 382
On estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
An integrated congestion management architecture for Internet hosts
Balakrishnan, H., Rahul, H. S., & Seshan, S. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316220 · Cited by 341
A survey of secure mobile Ad Hoc routing protocols
Abusalah, L., Khokhar, A., & Guizani, M. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080405 · Cited by 311
TCP performance issues over wireless links
Xylomenos, G., Polyzos, G. C., Mahonen, P., & Saaranen, M. (2001) · IEEE Communications Magazine · doi:10.1109/35.917504 · Cited by 308
Ongoing TCP Research Related to Satellites
Dawkins, S., Glover, D., Griner, J., Tran, D., Henderson, T., Heidemann, J., Touch, J., Kruse, H., Ostermann, S., Scott, K., et al. (2000) · doi:10.17487/rfc2760 · Cited by 284
Transport protocols for Internet-compatible satellite networks
Henderson, T. R., & Katz, R. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.748815 · Cited by 280
Host-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
Semke, J., Mahdavi, J., & Mathis, M. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285292 · Cited by 253
ATL: An Adaptive Transport Layer Suite for Next-Generation Wireless Internet
Akan, O. B., & Akyildiz, I. F. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.826919 · Cited by 75
Metadata
- Authors
- Stevens, W.
- Publisher
- RFC Editor
- Published
- 1997-01
- OpenAlex
- W2162405374
- Cited by
- 1,143
- References
- 2
- Type
- report
- 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.