<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.mathis-tcp-ratehalving" target="https://datatracker.ietf.org/doc/html/draft-mathis-tcp-ratehalving-00">
   <front>
      <title>The Rate-Halving Algorithm for TCP Congestion Control
</title>
      <author initials="M." surname="Mathis" fullname="Matt Mathis">
         </author>
      <author initials="J." surname="Mahdavi" fullname="Jamshid Mahdavi">
         <organization>Novell</organization>
      </author>
      <author initials="J." surname="Semke" fullname="Jeff Semke">
         </author>
      <date month="August" day="30" year="1999" />
      <abstract>
	 <t>This draft provides a detailed description of the Rate-Halving
algorithm.  As specified by RFC2581, Fast Recovery adjusts the
congestion window (cwnd) by transmitting new data only during the
second half of the recovery interval.  The Rate-Halving algorithm
adjusts the congestion window by spacing transmissions at the rate of
one data segment per two segments acknowledged over the entire
recovery period, thereby sustaining the self-clocking of TCP and
avoiding a burst.  Since it is largely independent of the details of
the data retransmission strategy, the Rate-Halving algorithm can be
used with several standard and experimental TCP implementations:
NewReno, SACK, and ECN.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-mathis-tcp-ratehalving-00" />
   
</reference>
