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

Łukasz Budzisz, Rade Stanojevic, Robert Shorten, Fred Baker

Research output: Contribution to journalArticle

15 Citations (Scopus)

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 delayand 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 lossbased flows are present. We provide analytical and simulation results to validate presented algorithm.

Original languageEnglish
Pages (from-to)555-557
Number of pages3
JournalIEEE Communications Letters
Volume13
Issue number7
DOIs
Publication statusPublished - 2009
Externally publishedYes

Fingerprint

Congestion Control
Packet loss
Coexistence
Control Algorithm
Switches
Queuing
Packet Loss
Networking
Switch
Strategy
Resources
Zero
Simulation

Keywords

  • Delay-based AIMD congestion control

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

A strategy for fair coexistence of loss and delay-based congestion control algorithms. / Budzisz, Łukasz; Stanojevic, Rade; Shorten, Robert; Baker, Fred.

In: IEEE Communications Letters, Vol. 13, No. 7, 2009, p. 555-557.

Research output: Contribution to journalArticle

Budzisz, Łukasz ; Stanojevic, Rade ; Shorten, Robert ; Baker, Fred. / A strategy for fair coexistence of loss and delay-based congestion control algorithms. In: IEEE Communications Letters. 2009 ; Vol. 13, No. 7. pp. 555-557.
@article{4d00333f82dd4e95ac3307a41b989d50,
title = "A strategy for fair coexistence of loss and delay-based congestion control algorithms",
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 delayand 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 lossbased flows are present. We provide analytical and simulation results to validate presented algorithm.",
keywords = "Delay-based AIMD congestion control",
author = "Łukasz Budzisz and Rade Stanojevic and Robert Shorten and Fred Baker",
year = "2009",
doi = "10.1109/LCOMM.2009.090305",
language = "English",
volume = "13",
pages = "555--557",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

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

AU - Budzisz, Łukasz

AU - Stanojevic, Rade

AU - Shorten, Robert

AU - Baker, Fred

PY - 2009

Y1 - 2009

N2 - 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 delayand 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 lossbased flows are present. We provide analytical and simulation results to validate presented algorithm.

AB - 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 delayand 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 lossbased flows are present. We provide analytical and simulation results to validate presented algorithm.

KW - Delay-based AIMD congestion control

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

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

U2 - 10.1109/LCOMM.2009.090305

DO - 10.1109/LCOMM.2009.090305

M3 - Article

VL - 13

SP - 555

EP - 557

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 7

ER -