@article{ Mathis99,
  author = {M. Mathis and J. Semke and J. Mahdavi and K. Lahey},
  title = {The Rate-Halving Algorithm for TCP congestion Control},
  journal = {Draft},
  year = {1999},
  month = {June},
  annote = {One problem with Fast Recovery is that it can add to the overall burstiness in the network. Once the cwnd has been halved (after fast retransmit), TCP waits for additional dupacks to arrive, indicating that half of the data in flight has left the network. This delay leads to that an entire window of data is transmitted in one half of one RTT. This burst of data can also cause additional bursts in successive RTTs. This Rate-halving algorithm proposed in the paper adjusts the cwnd 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. The algorithm can be used with both ECN, NewReno and SACK. },
  bibdate = {Sunday, June 16, 2002 at 20:36:36 (CEST)},
  submitter = {Katarina Asplund}
}

{"_id":"TPcw3d54JgmsqyKW4","bibbaseid":"mathis-semke-mahdavi-lahey-theratehalvingalgorithmfortcpcongestioncontrol-1999","downloads":0,"creationDate":"2015-12-04T23:32:58.177Z","title":"The Rate-Halving Algorithm for TCP congestion Control","author_short":["Mathis, M.","Semke, J.","Mahdavi, J.","Lahey, K."],"year":1999,"bibtype":"article","biburl":"http://www.cs.kau.se/cs/prtp/prtp.bib","bibdata":{"annote":"One problem with Fast Recovery is that it can add to the overall burstiness in the network. Once the cwnd has been halved (after fast retransmit), TCP waits for additional dupacks to arrive, indicating that half of the data in flight has left the network. This delay leads to that an entire window of data is transmitted in one half of one RTT. This burst of data can also cause additional bursts in successive RTTs. This Rate-halving algorithm proposed in the paper adjusts the cwnd 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. The algorithm can be used with both ECN, NewReno and SACK.","author":["Mathis, M.","Semke, J.","Mahdavi, J.","Lahey, K."],"author_short":["Mathis, M.","Semke, J.","Mahdavi, J.","Lahey, K."],"bibdate":"Sunday, June 16, 2002 at 20:36:36 (CEST)","bibtex":"@article{ Mathis99,\n author = {M. Mathis and J. Semke and J. Mahdavi and K. Lahey},\n title = {The Rate-Halving Algorithm for TCP congestion Control},\n journal = {Draft},\n year = {1999},\n month = {June},\n annote = {One problem with Fast Recovery is that it can add to the overall burstiness in the network. Once the cwnd has been halved (after fast retransmit), TCP waits for additional dupacks to arrive, indicating that half of the data in flight has left the network. This delay leads to that an entire window of data is transmitted in one half of one RTT. This burst of data can also cause additional bursts in successive RTTs. This Rate-halving algorithm proposed in the paper adjusts the cwnd 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. The algorithm can be used with both ECN, NewReno and SACK. },\n bibdate = {Sunday, June 16, 2002 at 20:36:36 (CEST)},\n submitter = {Katarina Asplund}\n}","bibtype":"article","id":"Mathis99","journal":"Draft","key":"Mathis99","month":"June","submitter":"Katarina Asplund","title":"The Rate-Halving Algorithm for TCP congestion Control","type":"article","year":"1999","bibbaseid":"mathis-semke-mahdavi-lahey-theratehalvingalgorithmfortcpcongestioncontrol-1999","role":"author","urls":{},"downloads":0},"search_terms":["rate","halving","algorithm","tcp","congestion","control","mathis","semke","mahdavi","lahey"],"keywords":[],"authorIDs":[],"dataSources":["6WGcSu2Ku7pZzqCcg"]}