@techreport{mathis-tcp-ratehalving-00,
    number =    {draft-mathis-tcp-ratehalving-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-mathis-tcp-ratehalving/00/},
    author =    {Matt Mathis and Jamshid Mahdavi and Jeff Semke},
    title =     {{The Rate-Halving Algorithm for TCP Congestion Control
}},
    pagetotal = 0,
    year =      1999,
    month =     aug,
    day =       30,
    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.},
}