Paper Info
Title
TCP-friendly Congestion Control for HighSpeed Network
Abstract
The currently used TCP congestion control, TCP Reno, has two weaknesses. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Secondly, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many researches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. This paper proposes a new TCP congestion control algorithm, which is based on the generalized Additive Increase Multiplicative Decrease (AIMD) rules. Our algorithm (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of our proposal by computer simulations and compare it with existing TCP.
Year
DOI
Venue
2007
10.1109/SAINT.2007.26
Hiroshima
Keywords
Field
DocType
proposed tcp,new tcp congestion control,highspeed network,tcp congestion control,tcp reno connections share,tcp-friendly congestion control,different rtts,highspeed tcp,tcp reno,connections coexist,scalable tcp,tcp reno drawback,computer simulation,bandwidth allocation,computer networks,transport protocols,congestion control,frame relay
TCP Westwood plus,Compound TCP,CUBIC TCP,Computer science,Computer network,Zeta-TCP,TCP acceleration,TCP Friendly Rate Control,TCP global synchronization,Distributed computing,TCP Westwood
Conference
ISBN
Citations 
PageRank 
0-7695-2756-6
0
0.34
References 
Authors
3
3
Name
Order
Citations
PageRank
Tomoya Hatano141.10
Hiroshi Shigeno216350.88
Ken-ichi Okada3346.15