CaltechAUTHORS
  A Caltech Library Service

Combating Bufferbloat in Multi-Bottleneck Networks: Equilibrium, Stability, and Algorithms

Ye, Jiancheng and Leung, Ka-Cheong and Li, Victor O. K. and Low, Steven H. (2018) Combating Bufferbloat in Multi-Bottleneck Networks: Equilibrium, Stability, and Algorithms. In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. IEEE , Piscataway, NJ, pp. 648-656. ISBN 978-1-5386-4128-6. https://resolver.caltech.edu/CaltechAUTHORS:20181023-103508493

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20181023-103508493

Abstract

Bufferbloat is a phenomenon where router buffers are constantly being filled, resulting in high queueing delay and delay variation. Larger buffer size and more delay-sensitive applications on the Internet have made this phenomenon a pressing issue. Active queue management (AQM) algorithms, which play an important role in combating bufferbloat, have not been widely deployed due to complicated manual parameter tuning. Moreover, AQM algorithms are often designed and analyzed based on models with a single bottleneck link, rendering their performance and stability unclear in multi-bottleneck networks. In this paper, we propose a general framework to combat bufferbloat in multi-bottleneck networks. We first conduct an equilibrium analysis for a general multi-bottleneck TCP/ AQM system and develop an algorithm to compute the equilibrium point. We then decompose the system into single-bottleneck subsystems and derive sufficient conditions for the local asymptotic stability of the subsystems. Using the proposed framework, we present a case study to analyze the stability of the recently proposed Controlled Delay (CoDel) in multi-bottleneck networks and devise Self-tuning CoDel to improve the system stability and performance. Extensive simulation results show that Self-tuning CoDel effectively stabilizes queueing delay in multi-bottleneck scenarios, and thus contributes to combating bufferbloat.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/INFOCOM.2018.8486251DOIArticle
ORCID:
AuthorORCID
Low, Steven H.0000-0001-6476-3048
Additional Information:© 2018 IEEE. This work was supported in part by the Research Grants Council, Hong Kong, China, under Grant No. 17204614.
Funders:
Funding AgencyGrant Number
Research Grants Council of Hong Kong17204614
Record Number:CaltechAUTHORS:20181023-103508493
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20181023-103508493
Official Citation:J. Ye, K. Leung, V. O. K. Li and S. H. Low, "Combating Bufferbloat in Multi-Bottleneck Networks: Equilibrium, Stability, and Algorithms," IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, Honolulu, HI, USA, 2018, pp. 648-656. doi: 10.1109/INFOCOM.2018.8486251
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:90360
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:23 Oct 2018 19:46
Last Modified:03 Oct 2019 20:24

Repository Staff Only: item control page