A strategy for fair coexistence of loss and delay-based congestion control algorithms

Authors:
Łukasz Budzisz;Rade Stanojevic;Robert Shorten;Fred Baker
Affiliations:
Hamilton Institute, NUI Maynooth, Ireland;Hamilton Institute, NUI Maynooth, Ireland;Hamilton Institute, NUI Maynooth, Ireland;Cisco Systems
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 2

Delay-based congestion avoidance for TCP

IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)

The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Emulating AQM from end hosts

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Revisiting TCP congestion control using delay gradients

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
On the fair coexistence of loss- and delay-based TCP

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Delay-based TCP variants have attracted a large amount of attention in the networking community because of their ability to efficiently use network resources, control queuing delays, exhibit virtually zero packet loss, etc. One major issue that discourages the wider deployment of delay-based TCP variants is their inability to co-exist fairly with standard loss-based TCP. In this note we propose a simple mechanism that allows delay-and loss-based (AIMD) TCP flows to compete fairly with each other. Further, our approach ensures that delay-based flows automatically (and swiftly) switch to a low-delay regime if no loss-based flows are present. We provide analytical and simulation results to validate presented algorithm.