Please use this identifier to cite or link to this item:
Title: A throughput deadlock-free TCP for high-speed Internet
Authors: Chang, RKC 
Chan, HY
Issue Date: 2000
Source: IEEE International Conference on Networks, 2000 : ICON 2000 : proceedings : September 2000, p. 87-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
Publisher: IEEE
ISBN: 0-7695-0777-8
DOI: 10.1109/ICON.2000.875773
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 21, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 13, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.