RFC 6582
The NewReno Modification to TCP's Fast Recovery Algorithm, April 2012
- File formats:
- Status:
- PROPOSED STANDARD
- Obsoletes:
- RFC 3782
- Authors:
- T. Henderson
S. Floyd
A. Gurtov
Y. Nishida - Stream:
- IETF
- Source:
- tcpm (wit)
Cite this RFC: TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC6582
Discuss this RFC: Send questions or comments to the mailing list tcpm@ietf.org
Other actions: View Errata | Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 6582
Abstract
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. [STANDARDS-TRACK]
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.