An Evaluation of BBR and its variants

TL;DR

This paper evaluates BBR and its variants, comparing their performance in simulated environments to understand their effectiveness in congestion control and network efficiency.

Contribution

It provides a comprehensive framework for comparing BBR and its variants, including recent BBR v2.0, in a controlled simulation setting.

Findings

BBR variants show different performance trade-offs.

BBR v2.0 improves upon earlier versions.

Simulation results highlight strengths and weaknesses of each algorithm.

Abstract

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.