TY - GEN
T1 - Enhancing TCP throughput and fairness with a timer-based transmission control over heterogeneous networks
AU - Jongmin, Lee
AU - Hojung, Cha
AU - Rhan, Ha
PY - 2006
Y1 - 2006
N2 - This paper presents a sender-side TCP congestion control mechanism that improves both throughput and fairness in wired as well as wireless networks. A traditional windows-based congestion control scheme adjusts the transmission rate only when the TCP sender receives an acknowledgement message or it detects a transmission timeout. Therefore, competing flows with different packet roundtrip times experience throughput unfairness because a flow with a short packet roundtrip time increases the transmission rate more quickly than the others do. Moreover, the cumulative acknowledgement message induces burst traffic, which overloads the network. In addition, packet losses delay the packet transmission until the amount of date transmitted without acknowledgements from the receiver equals to the reduced congestion window size, and it degrades transmission performance. The proposed mechanism adjusts the transmission rate based on a timer maintained by the TCP sender. As the mechanism adjusts the transmission rate regardless of the reception of acknowledgement messages, it improves fairness among flows with different packet roundtrip time, and prevents burst traffic caused by the cumulative acknowledgement message. The mechanism has been implemented in the Linux platform, and experienced with various TCP variants in real environments. The experimental result shows that the mechanism improves both throughput and fairness in wired as well as wireless networks.
AB - This paper presents a sender-side TCP congestion control mechanism that improves both throughput and fairness in wired as well as wireless networks. A traditional windows-based congestion control scheme adjusts the transmission rate only when the TCP sender receives an acknowledgement message or it detects a transmission timeout. Therefore, competing flows with different packet roundtrip times experience throughput unfairness because a flow with a short packet roundtrip time increases the transmission rate more quickly than the others do. Moreover, the cumulative acknowledgement message induces burst traffic, which overloads the network. In addition, packet losses delay the packet transmission until the amount of date transmitted without acknowledgements from the receiver equals to the reduced congestion window size, and it degrades transmission performance. The proposed mechanism adjusts the transmission rate based on a timer maintained by the TCP sender. As the mechanism adjusts the transmission rate regardless of the reception of acknowledgement messages, it improves fairness among flows with different packet roundtrip time, and prevents burst traffic caused by the cumulative acknowledgement message. The mechanism has been implemented in the Linux platform, and experienced with various TCP variants in real environments. The experimental result shows that the mechanism improves both throughput and fairness in wired as well as wireless networks.
UR - http://www.scopus.com/inward/record.url?scp=33845534965&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845534965&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33845534965
SN - 3540485635
SN - 9783540485636
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 650
EP - 659
BT - Information Networking
PB - Springer Verlag
T2 - International Conference on Information Networking, ICOIN 2006
Y2 - 16 January 2006 through 19 January 2006
ER -