<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.floyd-newreno" target="https://datatracker.ietf.org/doc/html/draft-floyd-newreno-00">
   <front>
      <title>The NewReno Modification to TCP&#x27;s Fast Recovery Algorithm</title>
      <author initials="S." surname="Floyd" fullname="Sally Floyd">
         <organization>ICSI</organization>
      </author>
      <author initials="T." surname="Henderson" fullname="Tom Henderson">
         <organization>Boeing</organization>
      </author>
      <date month="May" day="12" year="2003" />
      <abstract>
	 <t>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 &#x27;partial acknowledgments&#x27; (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].
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-floyd-newreno-00" />
   
</reference>
