A throughput deadlock-free TCP for high-speed Internet

Kow Chuen Chang, Ho Y. Chan

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

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 languageEnglish
Title of host publicationProceedings - IEEE International Conference on Networks 2000
Subtitle of host publicationNetworking Trends and Challenges in the New Millennium, ICON 2000
Pages87-92
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2000
Event2000 IEEE International Conference on Networks: Networking Trends and Challenges in the New Millennium, ICON 2000 - Singapore, Singapore
Duration: 5 Sep 20008 Sep 2000

Conference

Conference2000 IEEE International Conference on Networks: Networking Trends and Challenges in the New Millennium, ICON 2000
Country/TerritorySingapore
CitySingapore
Period5/09/008/09/00

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality

Cite this