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

31 Citations (Scopus)

Abstract

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
Volume19
Issue number6
DOIs
Publication statusPublished - Dec 2011
Externally publishedYes

Keywords

  • Delay-based congestion control
  • TCP

ASJC Scopus subject areas

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

Cite this

On the fair coexistence of loss-and delay-based tcp. / Budzisz, Lukasz; Stanojevic, Rade; Schlote, Arieh; Baker, Fred; Shorten, Robert.

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 6, 5960818, 12.2011, p. 1811-1824.

Research output: Contribution to journalArticle

Budzisz, L, Stanojevic, R, Schlote, A, Baker, F & Shorten, R 2011, 'On the fair coexistence of loss-and delay-based tcp', IEEE/ACM Transactions on Networking, vol. 19, no. 6, 5960818, pp. 1811-1824. https://doi.org/10.1109/TNET.2011.2159736
Budzisz, Lukasz ; Stanojevic, Rade ; Schlote, Arieh ; Baker, Fred ; Shorten, Robert. / On the fair coexistence of loss-and delay-based tcp. In: IEEE/ACM Transactions on Networking. 2011 ; Vol. 19, No. 6. pp. 1811-1824.
@article{bc27f4412583433ab8a19b0a1d1140aa,
title = "On the fair coexistence of loss-and delay-based tcp",
abstract = "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.",
keywords = "Delay-based congestion control, TCP",
author = "Lukasz Budzisz and Rade Stanojevic and Arieh Schlote and Fred Baker and Robert Shorten",
year = "2011",
month = "12",
doi = "10.1109/TNET.2011.2159736",
language = "English",
volume = "19",
pages = "1811--1824",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

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

AU - Budzisz, Lukasz

AU - Stanojevic, Rade

AU - Schlote, Arieh

AU - Baker, Fred

AU - Shorten, Robert

PY - 2011/12

Y1 - 2011/12

N2 - 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.

AB - 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.

KW - Delay-based congestion control

KW - TCP

UR - http://www.scopus.com/inward/record.url?scp=84655169566&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84655169566&partnerID=8YFLogxK

U2 - 10.1109/TNET.2011.2159736

DO - 10.1109/TNET.2011.2159736

M3 - Article

VL - 19

SP - 1811

EP - 1824

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

M1 - 5960818

ER -