DocumentCode :
2517303
Title :
A throughput deadlock-free TCP for high-speed Internet
Author :
Chang, Rocky K C ; Chan, Ho Y.
Author_Institution :
Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China
fYear :
2000
fDate :
2000
Firstpage :
87
Lastpage :
92
Abstract :
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 the high-speed Internet when compared with the send and receive socket buffer sizes. 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
Keywords :
Internet; adaptive systems; buffer storage; telecommunication congestion control; transport protocols; AAA; CS-AAA; congestion detection; congestion-sensitive adaptive acknowledgment algorithm; high-speed Internet; high-speed networks; maximum segment size; network congestion; receive socket buffer size; send socket buffer size; silly window syndrome avoidance algorithms; simulation results; slow-start-like mechanism; throughput deadlock-free TCP; throughput performance; transport control protocol; Computer networks; Delay; High-speed networks; Internet; Probes; Sampling methods; Sockets; System recovery; Throughput; Transport protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networks, 2000. (ICON 2000). Proceedings. IEEE International Conference on
Print_ISBN :
0-7695-0777-8
Type :
conf
DOI :
10.1109/ICON.2000.875773
Filename :
875773
Link To Document :
بازگشت