| V. Jacobson. Congestion Avoidance and Control In ACM SigComm Proceedings, pp 314-329, 1988. 10 |
....control is embodied in the TCP protocol. In oversimplified terms, when TCP suffers a packet loss, it decreases its sending rate (by decreasing its window size by a factor of two) when a packet is successfully delivered, it increases its sending rate (by increasing its window size by one) [2]. This process of additively increasing and multiplicatively decreasing (AIMD) the transmission rate can be thought of as a probing algorithm designed to find the maximal rate at which TCP can send packets under current conditions without incurring packet drops. While the AIMD approach is widely ....
V. Jacobson. Congestion Avoidance and Control In ACM SigComm Proceedings, pp 314-329, 1988.
....congestion control is embodied in the TCP protocol. In oversimpli ed terms, when TCP su ers a packet loss, it decreases its sending rate (by decreasing its window size by a factor of two) when a packet is successfully delivered, it increases its sending rate (by increasing its window size by one) [2]. This process of additively increasing and multiplicatively decreasing (AIMD) the transmission rate can be thought of as a probing algorithm designed to nd the maximal rate at which TCP can send packets under current conditions without incurring packet drops. While the AIMD approach is widely ....
V. Jacobson. Congestion Avoidance and Control In ACM SigComm Proceedings, pp 314-329, 1988. 10
No context found.
V. Jacobson. Congestion Avoidance and Control In ACM SigComm Proceedings, pp 314-329, 1988. 10
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