A throughput deadlock-free TCP for high-speed Internet

被引:0
作者
Chang, RKC [1 ]
Chan, HY [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China
来源
IEEE INTERNATIONAL CONFERENCE ON NETWORKS 2000 (ICON 2000), PROCEEDINGS: NETWORKING TRENDS AND CHALLENGES IN THE NEW MILLENNIUM | 2000年
关键词
D O I
10.1109/ICON.2000.875773
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Throughput deadlocks were observed when TCP was operated on high-speed networks. This deadlock problem is caused by the interaction of the sender-side and receiver-side silly window syndrome avoidance algorithms, because a TCP connection's Maximum Segment Size is no longer small on high-speed Internet when compared with the send and receive socket buffer sizes. In this paper we propose a new Congestion-Sensitive, Adaptive Acknowledgment Algorithm (CS-AAA) to solve the deadlock problem. Unlike our previously proposed AAA, the CS-AAA is able to respond to and to recover from congestion much faster than AAA. The CS-AAA solves this problem by detecting congestion, and performing a slow-start-like mechanism. Extensive simulation results support that CS-AAA's throughput performance significantly exceeds that of AAA, especially when the send buffer size is relatively large.
引用
收藏
页码:87 / 92
页数:6
相关论文
共 7 条