The NewReno Modification to TCP's Fast Recovery Algorithm
Open accessAbstract
RFC 5681 documents the following four intertwined TCP congestion control algorithms: slow start, congestion avoidance, fast retransmit, and fast recovery.RFC 5681 explicitly allows certain modifications of these algorithms, including modifications that use the TCP Selective Acknowledgment (SACK) option (RFC 2883), and modifications that respond to "partial acknowledgments" (ACKs that cover new data, but not all the data outstanding when loss was detected) in the absence of SACK.This document describes a specific algorithm for responding to partial acknowledgments, referred to as "NewReno".This response to partial acknowledgments was first proposed by Janey Hoe.This document obsoletes RFC 3782.
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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Improved TCP with Boosting DT classifier exhibits throughput gains over standard TCP-NewReno and TCP-Veno.
“The authors continue on to improve TCP with the Boosting DT classifier, which exhibit throughput gains over the standard TCP-NewReno [185] and TCP-Veno.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [185]
Their classifiers integrate two TCP variants that keep low control overhead for better performance over standard TCP-NewReno and TCP-SACK, and Burst-TCP for OBS networks.
“These classifiers integrate two TCP variants that keep a low control overhead for providing better performance (e.g. higher throughput and fewer timeouts) over the standard TCP-NewReno [185] and TCP-SACK [299], and Burst-TCP [490] for OBS networks.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [185]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Key words for use in RFCs to Indicate Requirement Levels
Bradner, S. O. (1997) · doi:10.17487/rfc2119 · Cited by 3,001 · see citing works
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523 · see citing works
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,150 · see citing works
Self-citationTCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. L. (2014) · doi:10.17487/rfc7323 · Cited by 1,013 · see citing works
Computing TCP's Retransmission Timer
Paxson, V., Allman, M. C., Chu, J., & Sargent, M. (2011) · doi:10.17487/rfc6298 · Cited by 826 · see citing works
Dynamics of random early detection
Lin, D., & Morris, R. (1997) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) · doi:10.1145/263105.263154 · Cited by 795 · see citing works
TCP Extensions for High Performance
Jacobson, V. L., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746 · see citing works
The NewReno Modification to TCP's Fast Recovery Algorithm
Floyd, S., & Henderson, T. (1999) · doi:10.17487/rfc2582 · Cited by 632 · see citing works
Self-citationImproving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/248156.248180 · Cited by 461 · see citing works
An Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., et al. (2000) · doi:10.17487/rfc2883 · Cited by 371 · see citing works
Self-citationEnhancing TCP's Loss Recovery Using Limited Transmit
Allman, M. C., Balakrishnan, H., & Floyd, S. (2001) · doi:10.17487/rfc3042 · Cited by 219 · see citing works
Self-citationA Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
Blanton, E., Allman, M. C., Fall, K., et al. (2003) · doi:10.17487/rfc3517 · Cited by 155 · see citing works
The Eifel Detection Algorithm for TCP
Ludwig, R., & Meyer, M. (2003) · doi:10.17487/rfc3522 · Cited by 88 · see citing works
Start-up dynamics of TCP's congestion control and avoidance schemes
Hoe, J. C. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 85 · see citing works
TCP and Successive Fast Retransmits
Floyd, S. (1995) · Cited by 55 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523 · see citing works
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 · see citing works
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 · see citing works
Bayesian packet loss detection for TCP
I'onseca, N., & Crovella, M. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498462 · Cited by 27 · see citing works
Improve throughput of TCP-Vegas in multihop ad hoc networks
Ding, L., Wang, X., Xu, Y., & Zhang, W. (2008) · Computer Communications · doi:10.1016/j.comcom.2008.03.026 · Cited by 13 · see citing works
- Authors
- Henderson, T., Floyd, S., Gurtov, A., & Nishida, Y.
- Affiliations
- University of Oulu (FI)
- ORCID
- Gurtov, A.
- Publisher
- RFC Editor
- Published
- 2012-04
- OpenAlex
- W2139378549
- Cited by
- 1,410
- References
- 15
- Citations by year
- 2026: 8 · 2025: 20 · 2024: 21 · 2023: 23 · 2022: 11 · 2021: 30 · 2020: 30 · 2019: 50 · 2018: 52 · 2017: 49 · 2016: 43 · 2015: 48 · 2014: 62 · 2013: 62 · 2012: 75
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- Keywords
- NewReno, TCP congestion control, TCP slow start, TCP congestion avoidance
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
