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.
Original language | English |
---|---|
Title of host publication | Proceedings - IEEE International Conference on Networks 2000 |
Subtitle of host publication | Networking Trends and Challenges in the New Millennium, ICON 2000 |
Pages | 87-92 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 1 Dec 2000 |
Event | 2000 IEEE International Conference on Networks: Networking Trends and Challenges in the New Millennium, ICON 2000 - Singapore, Singapore Duration: 5 Sept 2000 → 8 Sept 2000 |
Conference
Conference | 2000 IEEE International Conference on Networks: Networking Trends and Challenges in the New Millennium, ICON 2000 |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 5/09/00 → 8/09/00 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Software
- Electrical and Electronic Engineering
- Safety, Risk, Reliability and Quality