DocumentCode :
1632206
Title :
TCP congestion control algorithms and a performance comparison
Author :
Lai, Yuan-Cheng ; Yao, Chang-Li
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
fYear :
2001
fDate :
6/23/1905 12:00:00 AM
Firstpage :
523
Lastpage :
526
Abstract :
The evolution of TCP congestion control algorithms and underlying concepts of each algorithm are presented herein. According to their specific strategies, TCP algorithms are classified into four groups: Reno and NewReno, SACK and the variants, smooth-start and dynamic recovery (SSDR), and loss-avoidance algorithms. Numerous simulations are conducted to compare the performances of these TCP algorithms, and simulation results clearly indicate the merits and limitations of them. Comments are also presented to provide users and developers with a better understanding of these algorithms
Keywords :
digital simulation; telecommunication congestion control; transport protocols; NewReno; Reno; SACK; SSDR; TCP congestion control algorithms; loss-avoidance algorithms; performance comparison; simulation results; smooth-start and dynamic recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks, 2001. Proceedings. Tenth International Conference on
Conference_Location :
Scottsdale, AZ
ISSN :
1095-2055
Print_ISBN :
0-7803-7128-3
Type :
conf
DOI :
10.1109/ICCCN.2001.956315
Filename :
956315
Link To Document :
بازگشت