S. Keshav, "Flow control in high-speed networks with long delays", Proc. INET '92, Kobe, Japan, pp. 461-470, May 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....To prevent a loss in throughput, whenever a fast retransmit due to corruption occurs, the window is not decreased. However, since the window continues to grow linearly, it eventually reaches a value large enough to overflow the buffer of the bottleneck router. This is a wellknown problem of TCP [Kes91], but solving it is not the topic of this paper. This causes a fast retransmit due to congestion, and the window is reduced by half. Since the router can buffer an entire bandwidth delay product of the source (20 messages) the window grows to twice its optimum. Thus, it does not drop below the ....

Keshav S., Flow Control in High-Speed Networks with Long Delays", USENIX Conference, 1991.

....updates its sending rate using these estimates. Both estimates can be obtained in a number of ways. In the HBH scheme, adjacent intermediate nodes periodically exchange control packets which include these estimates [19] In the packet pair scheme, sources send pairs of packets close together [14]. The bottleneck rate is estimated by taking an inverse measure of the time between receiving the acknowledgement packets for such pairs. The bottleneck queue size is estimated by taking an average of the roundtrip times measured during a step, subtracting out the propagation delay (this delay can ....

S. Keshav, "Flow control in high-speed networks with long delays", Proc. INET '92, Kobe, Japan, pp. 461-470, May 1992.

No context found.

S. Keshav, "Flow control in high-speed networks with long delays", Proc. INET '92, Kobe, Japan, pp. 461-470, May 1992.

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