A Control-Theoretic Perspective on BBR/CUBIC Congestion-Control Competition
Simon Scherrer, Adrian Perrig, Stefan Schmid

TL;DR
This paper uses control theory to analyze the fairness and instability issues in BBR and CUBIC congestion control algorithms, providing conditions for oscillation and fairness bounds, and suggesting remedies.
Contribution
It extends a dynamic fluid model of BBR with control theory to predict oscillation conditions and fairness impacts in BBR/CUBIC competition.
Findings
BBR/CUBIC oscillation is frequent in practical networks.
Oscillation harms BBR fairness and can be predicted with the model.
Control-theoretic analysis suggests potential remedies for instability.
Abstract
To understand the fairness properties of the BBR congestion-control algorithm (CCA), previous research has analyzed BBR behavior with a variety of models. However, previous model-based work suffers from a trade-off between accuracy and interpretability: While dynamic fluid models generate highly accurate predictions through simulation, the causes of their predictions cannot be easily understood. In contrast, steady-state models predict CCA behavior in a manner that is intuitively understandable, but often less accurate. This trade-off is especially consequential when analyzing the competition between BBR and traditional loss-based CCAs, as this competition often suffers from instability, i.e., sending-rate oscillation. Steady-state models cannot predict this instability at all, and fluid-model simulation cannot yield analytical results regarding preconditions and severity of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
