DocumentCode
2218255
Title
The case for delay-based congestion control
Author
Jin, Cheng ; Wei, David X. ; Low, Steven H.
fYear
2003
fDate
20-21 Oct. 2003
Firstpage
99
Lastpage
104
Abstract
We argue that, in the absence of explicit feedback, delay-based algorithms become the preferred approach for end-to-end congestion control as networks scale up in capacity. Their advantage is small at low speed but decisive at high speed. The distinction between packet-level and flow-level problems of the current TCP exposes the difficulty of loss-based algorithms at large congestion windows.
Keywords
Internet; telecommunication congestion control; transport protocols; Internet; TCP Reno; delay-based algorithms; end-to-end congestion control; flow-level problems; packet-level problems; Availability; Communication system traffic control; Computer aided software engineering; Delay; Distributed algorithms; Distributed control; Feedback control; Internet; Stability; Supply and demand;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications, 2003. CCW 2003. Proceedings. 2003 IEEE 18th Annual Workshop on
Print_ISBN
0-7803-8239-0
Type
conf
DOI
10.1109/CCW.2003.1240796
Filename
1240796
Link To Document