TL;DR
This paper implements the BBR congestion control algorithm for DCCP within the Linux kernel and evaluates its impact on multi-path wireless scenarios, demonstrating performance improvements over previous algorithms.
Contribution
The paper introduces CCID5, a Linux kernel implementation of BBR for DCCP, and assesses its effectiveness in multi-path environments.
Findings
BBR improves multi-path performance over CCID2.
Faster bandwidth response reduces latency.
Enhanced reliability for unreliable traffic.
Abstract
Providing multi-connectivity services is an important goal for next generation wireless networks, where multiple access networks are available and need to be integrated into a coherent solution that efficiently supports both reliable and non reliable traffic. Based on virtual network interfaces and per path congestion controlled tunnels, the MP-DCCP based multiaccess aggregation framework presents as a novel solution that flexibly supports different path schedulers and congestion control algorithms as well as reordering modules. The framework has been implemented within the Linux kernel space and has been tested over different prototypes. Experimental results have shown that the overall performance strongly depends upon the congestion control algorithm used on the individual DCCP tunnels, denoted as CCID. In this paper, we present an implementation of the BBR (Bottleneck Bandwidth Round…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
