Ad-BBR: Enhancing Round-Trip Time Fairness and Transmission Stability in TCP-BBR
Future Internet · 22.04.2025 · 17 (5) · 189
DOI: 10.3390/fi17050189 ↗Kurz gefasst
Fachartikel in der Zeitschrift Future Internet, online erschienen am 22.04.2025. Verfasst von Mingjun Wang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Information and Communication Business Cost Project of JSCMC, Scientific Research Plan of JSLLKYJH.
Abstract (Originalsprache)
The rapid development of wireless network technology and the continuous evolution of network service demands have raised higher requirements for congestion control algorithms. In 2016, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) congestion control algorithm based on the Transmission Control Protocol (TCP) protocol. While BBR offers lower latency and higher throughput compared to traditional congestion control algorithms, it still faces challenges. These include the periodic triggering of the ProbeRTT phase, which impairs data transmission efficiency, data over-injection caused by the congestion window (CWND) value-setting policy, and the difficulty of coordinating resource allocation across multiple concurrent flows. These limitations make BBR less effective in multi-stream competition scenarios in high-speed wireless networks. This paper analyzes the design limitations of the BBR algorithm from a theoretical perspective and proposes the Adaptive-BBR (Ad-BBR) algorithm. The Ad-BBR algorithm incorporates real-time RTT and link queue-state information, introduces a new RTprop determination mechanism, and implements a finer-grained, RTT-based adaptive transmission rate adjustment mechanism to reduce data over-injection and improve RTT fairness. Additionally, the ProbeRTT phase-triggering mechanism is updated to ensure more stable and smoother data transmission. In the NS3, 5G, and Wi-Fi simulation experiments, Ad-BBR outperformed all comparison algorithms by effectively mitigating data over-injection and minimizing unnecessary entries into the ProbeRTT phase. Compared to the BBRv1 algorithm, Ad-BBR achieved a 17% increase in throughput and a 30% improvement in RTT fairness, along with a 13% reduction in the retransmission rate and an approximate 20% decrease in latency.
Förderung
- Information and Communication Business Cost Project of JSCMC
- Scientific Research Plan of JSLLKYJH
Zitieren
APA
Wang, M., Zhang, X., Jing, F., & Gao, M. (2025). Ad-BBR: Enhancing Round-Trip Time Fairness and Transmission Stability in TCP-BBR. Future Internet, 17(5), 189. https://doi.org/10.3390/fi17050189
Vancouver
Wang M, Zhang X, Jing F, Gao M. Ad-BBR: Enhancing Round-Trip Time Fairness and Transmission Stability in TCP-BBR. Future Internet. 2025;17(5):189. doi:10.3390/fi17050189
BibTeX
@article{Wang2025,
author = {Wang, Mingjun and Zhang, Xuezhi and Jing, Feng and Gao, Mei},
title = {Ad-BBR: Enhancing Round-Trip Time Fairness and Transmission Stability in TCP-BBR},
journal = {Future Internet},
year = {2025},
volume = {17},
number = {5},
pages = {189},
doi = {10.3390/fi17050189}
}
EUVIMED