BBR Fairness Evaluation Using NS-3
Linchuan Tang

TL;DR
This paper assesses the fairness of BBR congestion control in network simulations, revealing unfairness issues when multiple BBR flows compete, influenced by network parameters like RTT and buffer size.
Contribution
It provides a detailed evaluation of BBR fairness using NS-3, highlighting the causes of unfairness and the need for mechanisms to improve equitable bandwidth sharing.
Findings
Unfairness increases with RTT and buffer size.
BBR outperforms loss-based methods in single flow scenarios.
Lack of response mechanisms causes convergence issues.
Abstract
This paper evaluates the fairness of BBR congestion control using NS-3 simulator. While BBR improves performance over loss-based methods in single flows, unfairness issues emerge with competing BBR and BBR/Cubic flows. Unfairness correlates with factors like round-trip time and buffer size. The core reason is the lack of responding mechanisms for the flows to converge on fair bandwidth share.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTechnology and Data Analysis
