BBRp: Improving TCP BBR Performance Over WLAN

Grazia, Carlo Augusto; Klapez, Martin; Casoni, Maurizio

doi:10.1109/access.2020.2977834

Cited by 16 publications

(12 citation statements)

References 28 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In one work, the driver is modified to accommodate the FQ-CoDel solution in the firmware, controlling the Wi-Fi environment's bufferbloat phenomena without compromising the maximum aggregation size [3], while another work points on boosting the TCP fairness between competitive flows [2]. Finally, a TCP variant at the bases of BBRv2 [12], called BBRp [13], has been proposed to solve the BBRv1 inefficiency in Wi-Fi bottlenecks, allowing the congestion control to discover higher available bandwidth exploiting frame aggregation.…”

Section: Related Workmentioning

confidence: 99%

“…The other most critical parameter introduced and tested in this paper is the TP rate. TCP BBR does not react to any modification to the standard pacing value offered by the current Linux systems, so we used the BBRp patch [13] to allow BBR to use the same pacing rate of other congestion controls. The pacing rates used in this paper are named 1p, 2p and 3p: where 1p represents the standard pacing rate used by all the TCP variants, 2p doubles the values and so on.…”

Section: Testbedmentioning

confidence: 99%

See 1 more Smart Citation

Future of TCP on Wi-Fi 6

Grazia

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

The Linux TCP/IP stack contributions have recently pointed all in the same direction: maximize the available throughput while maintaining low latency. These activities started by mitigating the buffebloat phenomenon at the network bottleneck as much as possible. So far, the deployed solutions have been designed by considering standard models for the bottleneck that could be either wireless or wired. The introduction of Wi-Fi 6 is dislocating the bottleneck of standard home and office WLAN from the radio access point to the 1 Gbps interface, the one that points to the internet service provider; this bottleneck migration leads to a new real-case bottleneck model, which is hybrid. Such an environment embraces new technologies and provides new challenges for the old TCP protocol when applied to hybrid bottlenecks and operating in conjunction with the TCP side-modules, which are now part of the novel Linux kernels. This paper aims to highlight the TCP performance considering the new TCP modules and novel scenarios opened by Wi-Fi 6 with real-case hybrid bottlenecks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Testbedmentioning

confidence: 99%

Future of TCP on Wi-Fi 6

Grazia

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, the extensive research has been conducted to further improve the performance of BBR [24][25][26][27][28][29][30]. Moreover, Google has been actively working on developing BBR v2, an improved version of the current BBR v1 [31].…”

Section: A Brief Overview Of Bbrmentioning

confidence: 99%

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

et al. 2020

View full text Add to dashboard Cite

Multipath transmission control protocol (MPTCP) is a promising transport layer protocol that enables a device to utilize multiple communication interfaces simultaneously, thereby achieving high throughput. A congestion control algorithm (CCA) employed in MPTCP constitutes a key part that controls the data flow through different subflows (SFs). There are two fundamental challenges associated with MPTCP CCAs. First, MPTCP flows should have an advantage over single-path flows; second, MPTCP flows should be fair, indicating that SFs sharing a common bottleneck should occupy a capacity fairly close to that required by a single-path flow. Several MPTCP CCAs have been developed; however, they have failed to satisfy these challenges in all scenarios. Recently, Google has introduced the bottleneck bandwidth and round-trip-time (BBR), a new CCA for single-path TCP, achieving high throughput with minimum delay by employing a network model. In the present paper, we propose a novel MPTCP CCA based on BBR named coupled multipath BBR (C-MPBBR) that satisfies the fundamental challenges by exploiting the concept of network modeling in BBR. C-MPBBR addresses the first challenge by closing the lowbandwidth SFs by tracking the delivery rate and bottleneck bandwidth (BtlBW). Then, it satisfies the second challenge through identifying those SFs that share a common bottleneck and dividing the BtlBW share corresponding to a SF among them. We implemented C-MPBBR in the Linux kernel, tested it on a wide range of scenarios by the Mininet emulation experiments, and the real-world Internet, and confirmed that the proposed C-MPBBR outperforms the existing MPTCP CCAs in terms of successfully satisfying the fundamental challenges by ensuring both throughput and fairness.

show abstract

“…Aware of the problem of BBR algorithm, some scholars have modified the regulation factors of BBR to improve the defects of BBR itself [ 15 , 16 , 17 ]. On the other hand, BBR is applied to different network domains to achieve a better performance [ 18 , 19 , 20 , 21 ]. Google is also constantly optimizing BBR algorithm and updating BBR v2 version [ 22 ] to improve coexistence with other algorithms and reduce the attack.…”

Section: Introductionmentioning

confidence: 99%

Improvement of RTT Fairness Problem in BBR Congestion Control Algorithm by Gamma Correction

Pan

Tan

et al. 2021

Sensors

View full text Add to dashboard Cite

Google proposed the bottleneck bandwidth and round-trip propagation time (BBR), which is a new congestion control algorithm. BBR creates a network path model by measuring the available bottleneck bandwidth and the minimum round-trip time (RTT) to maximize delivery rate and minimize latency. However, some studies have shown that there are serious RTT fairness problems in the BBR algorithm. The flow with longer RTT will consume more bandwidth and the flows with shorter RTT will be severely squeezed or even starved to death. Moreover, these studies pointed out that even small RTT differences will lead to the throughput of BBR flows being unfair. In order to solve the problem of RTT fairness, an improved algorithm BBR-gamma correction (BBR-GC) is proposed. BBR-GC algorithm takes RTT as feedback information, and then uses the gamma correction function to fit the adaptive pacing gain. This approach can make different RTT flows compete for bandwidth more fairly, thus alleviating the RTT fairness issue. The simulation results of Network Simulator 3 (NS3) show that that BBR-GC algorithm cannot only ensure the channel utilization, but also alleviate the RTT fairness problem of BBR flow in different periods. Through the BBR-GC algorithm, RTT fairness is improved by 50% and the retransmission rate is reduced by more than 26%, compared with that of the original BBR in different buffer sizes.

show abstract

BBRp: Improving TCP BBR Performance Over WLAN

Cited by 16 publications

References 28 publications

Future of TCP on Wi-Fi 6

Future of TCP on Wi-Fi 6

Coupled Multipath BBR (C-MPBBR): A Efficient Congestion Control Algorithm for Multipath TCP

Improvement of RTT Fairness Problem in BBR Congestion Control Algorithm by Gamma Correction

Contact Info

Product

Resources

About