Improved Control Mechanism of Bottleneck Bandwidth and Round-Trip Propagation Time v3 Congestion with Enhanced Fairness and Efficiency

The widespread adoption and popularity of various applications have led to large and frequent data transmissions, resulting in network congestion, high packet delays, and packet loss. In 2016, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) algorithm to mitigate networ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering proceedings Ročník 89; číslo 1; s. 11
Hlavní autoři: Hung-Chi Chu, Hao-Chu Chiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: MDPI AG 01.02.2025
Témata:
BBR
congestion control
ISSN:2673-4591
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The widespread adoption and popularity of various applications have led to large and frequent data transmissions, resulting in network congestion, high packet delays, and packet loss. In 2016, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) algorithm to mitigate network congestion. However, its network fairness is poor. Consequently, BBRv2 and BBRv3 were introduced in 2018 and 2023 as improved versions. Although BBRv2 exhibited enhanced fairness, its bandwidth utilization rate was lower than that of other existing methods. Meanwhile, BBRv3 still lacked bandwidth fairness in its initial transmission. Therefore, we have improved the fairness based on BBRv3 by considering the maximum sending rate and utilizing connections at different times. Good fairness and bandwidth utilization are maintained on the bottleneck bandwidth with the improved method. The method outperforms Cubic Binary Increase Congestion Control (CUBIC) and BBRv3 in terms of bandwidth utilization and network usage fairness.
ISSN:2673-4591
DOI:10.3390/engproc2025089011