Operating ranges, tunability and performance of CoDel and PIE

Nicolas Kuhn, David Ros, Amadou Baba Bagayoko, Chamil Premantha Kulatunga, Gorry Fairhurst, Naeem Khademi

Research output: Contribution to journalArticle

10 Citations (Scopus)
5 Downloads (Pure)

Abstract

Bufferbloat is excessive delay due to the accumulation of packets in a router’s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED’s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.
Original languageEnglish
Pages (from-to)74-82
Number of pages9
JournalComputer Communications
Volume103
Early online date29 Jul 2016
DOIs
Publication statusPublished - 1 May 2017

Fingerprint

Routers
Tuning

Keywords

  • Bufferbloat
  • AQM
  • Congestion controls
  • CoDel
  • PIE

Cite this

Operating ranges, tunability and performance of CoDel and PIE. / Kuhn, Nicolas; Ros, David; Bagayoko, Amadou Baba; Kulatunga, Chamil Premantha; Fairhurst, Gorry; Khademi, Naeem.

In: Computer Communications, Vol. 103, 01.05.2017, p. 74-82.

Research output: Contribution to journalArticle

Kuhn, Nicolas ; Ros, David ; Bagayoko, Amadou Baba ; Kulatunga, Chamil Premantha ; Fairhurst, Gorry ; Khademi, Naeem. / Operating ranges, tunability and performance of CoDel and PIE. In: Computer Communications. 2017 ; Vol. 103. pp. 74-82.
@article{4f56141af9a6463b9ee920c88980b113,
title = "Operating ranges, tunability and performance of CoDel and PIE",
abstract = "Bufferbloat is excessive delay due to the accumulation of packets in a router’s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED’s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.",
keywords = "Bufferbloat , AQM, Congestion controls, CoDel, PIE",
author = "Nicolas Kuhn and David Ros and Bagayoko, {Amadou Baba} and Kulatunga, {Chamil Premantha} and Gorry Fairhurst and Naeem Khademi",
note = "COMCOM-D-15-00474R1 This work was part-funded by the European Community under its Seventh Framework Programme through the Reducing Internet Transport Latency (RITE) project (ICT-317700). The views expressed are solely those of the authors.",
year = "2017",
month = "5",
day = "1",
doi = "10.1016/j.comcom.2016.07.013",
language = "English",
volume = "103",
pages = "74--82",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",

}

TY - JOUR

T1 - Operating ranges, tunability and performance of CoDel and PIE

AU - Kuhn, Nicolas

AU - Ros, David

AU - Bagayoko, Amadou Baba

AU - Kulatunga, Chamil Premantha

AU - Fairhurst, Gorry

AU - Khademi, Naeem

N1 - COMCOM-D-15-00474R1 This work was part-funded by the European Community under its Seventh Framework Programme through the Reducing Internet Transport Latency (RITE) project (ICT-317700). The views expressed are solely those of the authors.

PY - 2017/5/1

Y1 - 2017/5/1

N2 - Bufferbloat is excessive delay due to the accumulation of packets in a router’s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED’s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.

AB - Bufferbloat is excessive delay due to the accumulation of packets in a router’s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED’s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.

KW - Bufferbloat

KW - AQM

KW - Congestion controls

KW - CoDel

KW - PIE

U2 - 10.1016/j.comcom.2016.07.013

DO - 10.1016/j.comcom.2016.07.013

M3 - Article

VL - 103

SP - 74

EP - 82

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

ER -