Technical Summary
From the 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 Acknowledgement (SACK) option (RFC 2883),
and modifications that respond to "partial acknowledgments" (ACKs
which 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.
Working Group Summary
Nothing exceptional occurred during the working group process for this
document.
Document Quality
This document is an update to TCP NewReno, to address issues that
have been found with existing RFC 3782 implementations, of which
there are several. In the Acknowledgments section:
Many thanks to Anil Agarwal, Mark Allman, Armando Caro, Jeffrey Hsu,
Vern Paxson, Kacheong Poon, Keyur Shah, and Bernie Volz for detailed
feedback on this document or on its precursor, RFC 2582. Jeffrey
Hsu provided clarifications on the handling of the recover variable
that were applied to RFC 3782 as errata, and now are in Section 8
of this document. Yoshifumi Nishida contributed a modification
to the fast recovery algorithm to account for the case in which
flightsize is 0 when the TCP sender leaves fast recovery, and the
TCP receiver uses delayed acknowledgments. Alexander Zimmermann
provided several suggestions to improve the clarity of the document.
Personnel
David Borman (david.borman@windriver.com) is the document shepherd.
Wes Eddy (wes@mti-systems.com) is the responsible AD.