Tackling Bufferbloat in Capacity-limited Networks

Chamil Premantha Weerasinghe Kulatunga, Nicolas Kuhn, Gorry Fairhurst, D Ros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have trouble in controlling the queuing delay, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if they are claimed to be insensitive to link rates and round-trip delays. We show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We run experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the downloading time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.
Original languageEnglish
Title of host publication2015 European Conference on Networks and Communications
Subtitle of host publicationTrack 4- Networking (NET)
PublisherIEEE Press
Pages381-385
Number of pages6
ISBN (Electronic)978-1-4673-7359-3
ISBN (Print)978-1-4673-7358-6
DOIs
Publication statusPublished - 29 Jun 2015
EventEuropean Conference On Networks And Communications (EuCNC) - Paris, France
Duration: 29 Jun 20152 Jul 2015

Conference

ConferenceEuropean Conference On Networks And Communications (EuCNC)
CountryFrance
CityParis
Period29/06/152/07/15

Fingerprint

Parameterization
Satellites
Internet
Experiments

Keywords

  • CoDel
  • AQM
  • Bufferbloat
  • Rural Broadband

Cite this

Kulatunga, C. P. W., Kuhn, N., Fairhurst, G., & Ros, D. (2015). Tackling Bufferbloat in Capacity-limited Networks. In 2015 European Conference on Networks and Communications: Track 4- Networking (NET) (pp. 381-385). IEEE Press. https://doi.org/10.1109/EuCNC.2015.7194103

Tackling Bufferbloat in Capacity-limited Networks. / Kulatunga, Chamil Premantha Weerasinghe; Kuhn, Nicolas; Fairhurst, Gorry; Ros, D .

2015 European Conference on Networks and Communications: Track 4- Networking (NET). IEEE Press, 2015. p. 381-385.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kulatunga, CPW, Kuhn, N, Fairhurst, G & Ros, D 2015, Tackling Bufferbloat in Capacity-limited Networks. in 2015 European Conference on Networks and Communications: Track 4- Networking (NET). IEEE Press, pp. 381-385, European Conference On Networks And Communications (EuCNC), Paris, France, 29/06/15. https://doi.org/10.1109/EuCNC.2015.7194103
Kulatunga CPW, Kuhn N, Fairhurst G, Ros D. Tackling Bufferbloat in Capacity-limited Networks. In 2015 European Conference on Networks and Communications: Track 4- Networking (NET). IEEE Press. 2015. p. 381-385 https://doi.org/10.1109/EuCNC.2015.7194103
Kulatunga, Chamil Premantha Weerasinghe ; Kuhn, Nicolas ; Fairhurst, Gorry ; Ros, D . / Tackling Bufferbloat in Capacity-limited Networks. 2015 European Conference on Networks and Communications: Track 4- Networking (NET). IEEE Press, 2015. pp. 381-385
@inproceedings{e9ab6802bbf74af8ad20845cc3ca2d3f,
title = "Tackling Bufferbloat in Capacity-limited Networks",
abstract = "Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have trouble in controlling the queuing delay, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if they are claimed to be insensitive to link rates and round-trip delays. We show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We run experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the downloading time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.",
keywords = "CoDel, AQM, Bufferbloat, Rural Broadband",
author = "Kulatunga, {Chamil Premantha Weerasinghe} and Nicolas Kuhn and Gorry Fairhurst and D Ros",
year = "2015",
month = "6",
day = "29",
doi = "10.1109/EuCNC.2015.7194103",
language = "English",
isbn = "978-1-4673-7358-6",
pages = "381--385",
booktitle = "2015 European Conference on Networks and Communications",
publisher = "IEEE Press",

}

TY - GEN

T1 - Tackling Bufferbloat in Capacity-limited Networks

AU - Kulatunga, Chamil Premantha Weerasinghe

AU - Kuhn, Nicolas

AU - Fairhurst, Gorry

AU - Ros, D

PY - 2015/6/29

Y1 - 2015/6/29

N2 - Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have trouble in controlling the queuing delay, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if they are claimed to be insensitive to link rates and round-trip delays. We show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We run experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the downloading time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.

AB - Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have trouble in controlling the queuing delay, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if they are claimed to be insensitive to link rates and round-trip delays. We show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We run experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the downloading time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.

KW - CoDel

KW - AQM

KW - Bufferbloat

KW - Rural Broadband

U2 - 10.1109/EuCNC.2015.7194103

DO - 10.1109/EuCNC.2015.7194103

M3 - Conference contribution

SN - 978-1-4673-7358-6

SP - 381

EP - 385

BT - 2015 European Conference on Networks and Communications

PB - IEEE Press

ER -