Improving congestion avoidance algorithms for asymmetric networks

Omar Elloumi, Hossam Afifi, Maher Hamdi

Research output: Contribution to conferencePaperpeer-review

Abstract

Congestion avoidance algorithms considering the network as a black-box model detect congestion through packet loss and variation in the throughput or in the Round Trip Delay. In this paper we show, by means of analysis and simulation, an undesirable effect acting on delay and throughput based congestion avoidance algorithms. This effect is caused by congestion experienced by acknowledgments. We propose to change these algorithms by dividing the round trip time into a Forward Trip Time and a Backward Trip Time. We show the performance improvement using this distinction. Finally, we describe a possible implementation in the TCP protocol.

Original languageEnglish
Pages1417-1421
Number of pages5
Publication statusPublished - 1 Jan 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can
Duration: 8 Jun 199712 Jun 1997

Conference

ConferenceProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityMontreal, Can
Period8/06/9712/06/97

Fingerprint

Dive into the research topics of 'Improving congestion avoidance algorithms for asymmetric networks'. Together they form a unique fingerprint.

Cite this