Papers › An Evaluation of BBR and its variants
An Evaluation of BBR and its variants
Songyang Zhang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The congestion control algorithm bring such importance that it avoids the network link into severe congestion and guarantees network normal operation. Since The loss based algorithms introduce high transmission delay, to design new algorithm simultaneously achieving high throughout and low buffer occupation is a new working direction. The bottleneck bandwidth and round trip time (BBR) belongs such kind, and it has drawn much attention since its release. There are other algorithms modified from BBR to gain better performance. And the implementation of BBR v2.0 is released recently. We implement a framework to compare the performance of these algorithms in simulated environment.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections