Multipath transmission control protocol (MPTCP) allows TCP (transmission control protocol) connections to operate across multiple paths concurrently to help improve resource utilization as well as connection robustness. Existing congestion algorithms for MPTCP are mainly loss-based, thus leading to severe performance degradation in wireless environment and buffer bloat on network devices. In this paper, to get rid of these shortcomings, we modify a congestion based TCP congestion control algorithm (bottleneck bandwidth and round-trip propagation time, or BBR) and propose a new congestion control algorithm for MPTCP based on bottleneck estimation, whose name is weighted BBR (wBBR). We introduce weight factors to subflows in MPTCP flows to control convergence bandwidth of each subflow, and then propose an iterative algorithm to lead the network to a fairer convergence when BBR/wBBR flows sharing bottleneck links. Simulation results show that our design has better performance in terms of bottleneck fairness compared with other MPTCP congestion control algorithms. And of course, it inherits the advantages of the BBR algorithm - let the network work at the point with max bandwidth and min queue.
wBBR: A Bottleneck Estimation-Based Congestion Control for Multipath TCP
2018-08-01
409473 byte
Conference paper
Electronic Resource
English
Multipath Routing Compatible Congestion Control
IEEE | 2024
|Bottleneck congestion: Differentiating the coarse charge
Online Contents | 2016
|Managing bottleneck congestion with tradable credits
Online Contents | 2013
|Congestion derivatives for a traffic bottleneck
Online Contents | 2010
|