Skip to main content

The Rate-Halving Algorithm for TCP Congestion Control

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Matt Mathis , Jamshid Mahdavi , Jeff Semke
Last updated 1999-08-30
RFC stream (None)
Intended RFC status (None)
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:


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.


Matt Mathis
Jamshid Mahdavi
Jeff Semke

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