On the fair coexistence of loss-and delay-based tcp

Lukasz Budzisz, Rade Stanojevic, Arieh Schlote, Fred Baker, Robert Shorten

Research output: Contribution to journalArticle

33 Citations (Scopus)


This paper presents and develops a novel delay-based additive increase, multiplicative decrease (AIMD) congestion control algorithm. The main features of the proposed solution include: 1) low standing queues and delay in homogeneous environments (with delay-based flows only); 2) fair coexistence of delay-and loss-based flows in heterogeneous environments; 3) delay-based flows behave as loss-based flows when loss-based flows are present in the network; otherwise they revert to delay-based operation. It is also shown that these properties can be achieved without any appreciable increase in network loss rate over that which would be present in a comparable network of standard TCP flows (loss-based AIMD). To demonstrate the potential of the presented algorithm, both analytical and simulation results are provided in a range of different network scenarios. These include stability and convergence results in general multiple-bottleneck networks and a number of simulation scenarios to demonstrate the utility of the proposed scheme. In particular, we show that networks employing our algorithm have the features of networks in which RED AQM's are deployed. Furthermore, in a wide range of situations (including high-speed scenarios), we show that low delay is achieved irrespective of the queueing algorithm employed in the network, with only sender-side modification to the basic AIMD algorithm.

Original languageEnglish
Article number5960818
Pages (from-to)1811-1824
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number6
Publication statusPublished - Dec 2011
Externally publishedYes


  • Delay-based congestion control
  • TCP

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this