A Modified TCP BBR to Enable High Fairness in High-Speed Wireless Networks

Jinlin Xu, Wansu Pan, Haibo Tan (), Longle Cheng, Xiru Li and Xiaofeng Li
Additional contact information
Jinlin Xu: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
Wansu Pan: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
Haibo Tan: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
Longle Cheng: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
Xiru Li: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
Xiaofeng Li: Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China

Future Internet, 2024, vol. 16, issue 11, 1-16

Abstract: Wireless networks, especially 5G and WiFi networks, have made great strides in increasing network bandwidth and coverage over the past decades. However, the mobility and channel conditions inherent to wireless networks have the potential to impair the performance of traditional Transmission Control Protocol (TCP) congestion control algorithms (CCAs). Google proposed a novel TCP CCA based on Bottleneck Bandwidth and Round-Trip propagation time (BBR), which is capable of achieving high transmission rates and low latency through the estimation of the available bottleneck capacity. Nevertheless, some studies have revealed that BBR exhibits deficiencies in fairness among flows with disparate Round-Trip Times (RTTs) and also displays inter-protocol unfairness. In high-speed wireless networks, ensuring fairness is of paramount importance to guarantee equitable bandwidth allocation among diverse traffic types and to enhance overall network utilization. To address this issue, this paper proposes a BBR–Pacing Gain (BBR–PG) algorithm. By deriving the pacing rate control model, the impact of pacing gain on BBR fairness is revealed. Adjusting the pacing gain according to the RTT can improve BBR’s performance. Simulations and real network experiments have shown that the BBR–PG algorithm retains the throughput advantages of the original BBR algorithm while significantly enhancing fairness. In our simulation experiments, RTT fairness and intra-protocol fairness were improved by 50% and 46%, respectively.

Keywords: congestion control; BBR; pacing gain; high fairness; low retransmission (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/1999-5903/16/11/392/pdf (application/pdf)
https://www.mdpi.com/1999-5903/16/11/392/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:16:y:2024:i:11:p:392-:d:1506986

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().