@techreport{floyd-newreno-00,
    number =    {draft-floyd-newreno-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-floyd-newreno/00/},
    author =    {Sally Floyd and Tom Henderson},
    title =     {{The NewReno Modification to TCP's Fast Recovery Algorithm}},
    pagetotal = 15,
    year =      2003,
    month =     may,
    day =       12,
    abstract =  {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 'partial acknowledgments' (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{]}.},
}