The Rate-Halving Algorithm for TCP Congestion Control
draft-mathis-tcp-ratehalving-00

Document Type Expired Internet-Draft (individual)
Authors Matt Mathis  , Jamshid Mahdavi  , Jeff Semke 
Last updated 1999-08-30
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
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-mathis-tcp-ratehalving-00.txt

Abstract

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.

Authors

Matt Mathis (mathis@psc.edu)
Jamshid Mahdavi (mahdavi@psc.edu)
Jeff Semke (semke@psc.edu)

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