| Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Kevin Lahey, The Rate-Halving Algorithm for TCP Congestion Control, June 1999. URL "http://www.psc.edu/networking/ftp/papers/draftratehalving. txt". |
....algorithm, without checking to see if the previous value of the congestion window has in fact been used. This document proposes that the window increase algorithm not be invoked Handley et al. Page 3] draft handley TCP TCP Congestion Window Validation March 2000 during application limited periods [MSML99]. In particular, the TCP sender should not increase the congestion window when the TCP sender has been application limited (and therefore has not fully used the current congestion window) This restriction prevents the congestion window from growing arbitrarily large, in the absence of evidence ....
Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Kevin Lahey, The Rate-Halving Algorithm for TCP Congestion Control, June 1999. URL "http://www.psc.edu/networking/ftp/papers/draftratehalving. txt".
....advertised window and the slow start or congestion avoidance window increase algorithm, without checking to see if the previous value of the congestion window has in fact been used. This draft proposes that the window increase algorithm not be invoked during application limited periods [MSML99]. In particular, the TCP sender should not increase the congestion window when the TCP sender has been application limited (and therefore has not fully used the current congestion window) This restriction prevents the congestion window from growing arbitrarily large, in the absence of evidence ....
Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Kevin Lahey, The Rate-Halving Algorithm for TCP Congestion Control, June 1999. URL "http://www.psc.edu/networking/ftp/papers/draftratehalving. txt".
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC