Model-based insights on the performance, fairness, and stability of BBR
Authors:
Open Access
- 25 October 2022
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 519-537
Abstract
Google's BBR is the most prominent result of the recently revived quest for efficient, fair, and flexible congestion-control algorithms (CCAs). While BBR has been investigated by numerous studies, previous work still leaves gaps in the understanding of BBR performance: Experiment-based studies generally only consider network settings that researchers can set up with manageable effort, and model-based studies neglect important issues like convergence. To complement previous BBR analyses, this paper presents a fluid model of BBRv1 and BBRv2, allowing both efficient simulation under a wide variety of network settings and analytical treatment such as stability analysis. By experimental validation, we show that our fluid model provides highly accurate predictions of BBR behavior. Through extensive simulations and theoretical analysis, we arrive at several insights into both BBR versions, including a previously unknown bufferbloat issue in BBRv2.Keywords
All Related Versions
Funding Information
- Bundesministerium für Forschung, Technologie und Raumfahrt (16KISK020K)
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (200021L_182005)
This publication has 42 references indexed in Scilit:
- Finishing flows quickly with preemptive schedulingACM SIGCOMM Computer Communication Review, 2012
- Deadline-aware datacenter tcp (D2TCP)ACM SIGCOMM Computer Communication Review, 2012
- Revisiting TCP Congestion Control Using Delay Gradients2011
- CUBICACM SIGOPS Operating Systems Review, 2008
- Generalized Modeling and Stability Analysis of HighSpeed TCP and Scalable TCPIEICE Transactions on Communications, 2006
- Analysis of a Feedback Fluid Model for Heterogeneous TCP SourcesStochastic Models, 2003
- Internet congestion controlIEEE Control Systems, 2002
- Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED2000
- Dynamic queue length thresholds for shared-memory packet switchesIEEE/ACM Transactions on Networking, 1998
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998