V. Jacobson. Congestion avoidance and control. SIGCOMM Symposium on Communication Architectures and Protocols, pages 314--329, 1988. An updated version is available via ftp: //ftp.ee.lbl.gov/papers/congavoid.ps.Z.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....If congestion is persistent then the link will start to drop packets when its bu#ers are full; this dropping is an implicit congestion signal to end systems that is inferred by a TCP sender through timeouts, duplicate acknowledgements, and selective acknowledgements. TCP congestion control [8] is a closed loop control implemented at communicating end systems which moderates a flow s sending rate using this implicit signaling. This control reduces the packet loss experienced at congested links and the possibility of congestion collapse that arose in the Internet when persistent ....

....range [4.5, 8.0] for a Poisson packet arrival at queues or a Gaussian arrival process with # 1.0 and an implied # of 8. 3. 3 Changes to TCP The most relevant points of TCP congestion control implementation are outlined here to provide a baseline for changes; for a more complete treatment see [8]. The sender can have a window of sent but not yet acknowledged packets in flight with the size of this window being the minimum of the congestion window, cwnd r , and the receiver s available receive bu#er. The receiver acknowledges the receipt of data back to the sender indicating successful ....

V. Jacobson. Congestion avoidance and control. SIGCOMM Symposium on Communication Architectures and Protocols, pages 314--329, 1988. An updated version is available via ftp: //ftp.ee.lbl.gov/papers/congavoid.ps.Z.

....do not use a decrease by half reduction in response to congestion. In DECbit, which was also based on AIMD, flows reduced their sending rate to 7 8 of the old value in response to a packet drop [11] Similarly, in Van Jacobson s 1992 revision of his 1988 paper on Congestion Avoidance and Control [9], the main justification for a decrease term of 1 2 instead of 7 8, in Appendix D of the revised version of the paper, is that the performance penalty for a decrease term of 1 2 is small. A relative evaluation of AIMD and equation based congestion control in [4] explores the benefits of ....

V. Jacobson. Congestion Avoidance and Control. SIGCOMM Symposium on Communications Architectures and Protocols, pages 314--329, 1988. An updated version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.

.... just as it is possible to build dangerous implementations of TCP without SACK (dangerous, that is, to other users of the Internet) However, implementations of TCP with SACK should follow the underlying congestion control principles that have guided TCP implementations for the last eight years [Jac88]. That is, for every window of data from which one or more packets is dropped, the sender interprets this as an in This work was supported by the Director, Office of Energy Research, Scientific Computing Staff, of the U.S. Department of Energy under Contract No. DE AC03 76SF00098. dication of ....

V. Jacobson. Congestion avoidance and control. SIGCOMM Symposium on Communications Architectures and Protocols, pages 314-- 329, 1988. An updated version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.

No context found.

V. Jacobson. Congestion avoidance and control. SIGCOMM Symposium on Communication Architectures and Protocols, pages 314--329, 1988. An updated version is available via ftp: //ftp.ee.lbl.gov/papers/congavoid.ps.Z.

....is greater than the link s capacity and any other contention as transient. Today congestion is signaled to end systems implicitly through the detection of packet drops with a sensitivity to queuing delay also embedded in the TCP protocol. How deployed TCP stacks react to congestion was proposed in [6] and has remained largely unchanged since. This closed loop control reduces packet loss and the possibility of congestion collapse that arose in the Internet when persistent contention was left uncontrolled. An outcome of this control is the allocation of a scarce resource amongst those wishing to ....

V. Jacobson. Congestion avoidance and control. SIGCOMM Symposium on Communication Architectures and Protocols, pages 314--329, 1988. An updated version is available via ftp://ftp.ee. lbl.gov/papers/congavoid.ps.Z.

....members in the group. It is this linear factor which allows for a constant amount of control trac when summed across all members. The interval between RTCP packets is varied randomly over the range [0.5,1. 5] times the calculated interval to avoid unintended synchronization of all participants [20]. The rst RTCP packet sent after joining a session is also delayed by a random variation of half the minimum RTCP interval. A dynamic estimate of the average compound RTCP packet size is calculated, including all those received and sent, to automatically adapt to changes in the amount of ....

S. Floyd and V. Jacobson, \The synchronization of periodic routing messages," in SIGCOMM Symposium on Communications Architectures and Protocols (D. P. Sidhu, ed.), (San Francisco, California), pp. 33-44, ACM, Sept. 1993. also in [32].

No context found.

V. Jacobson Congestion Avoidance and Control, SIGCOMM Symposium on Communications Architectures and Protocols, pages 314-329, 1988.

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