The NewReno Modification to TCP's Fast Recovery Algorithm
draft-floyd-newreno-00

Document Type Expired Internet-Draft (individual)
Last updated 2003-05-12
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-floyd-newreno-00.txt

Abstract

RFC 2581 [RFC2581] documents the following four intertwined TCP congestion control algorithms: Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery. RFC 2581 [RFC2581] explicitly allows certain modifications of these algorithms, including modifications that use the TCP Selective Acknowledgement (SACK) option [RFC2018], 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. The NewReno mechanism described in 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 in [Hoe95].

Authors

Sally Floyd (floyd@icir.org)
Tom Henderson (tomh@cs.berkeley.edu)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)