| 1. |
- Moreno, N. R., et al.
(författare)
-
CCID5 : An implementation of the BBR congestion control algorithm for DCCP and its impact over multi-path scenarios
- 2021
-
Ingår i: ANRW 2021 - Proceedings of the 2021 Applied Networking Research Workshop. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450386180 ; , s. 52-58
-
Konferensbidrag (refereegranskat)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 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 Trip propagation time) congestion control algorithm for DCCP in the Linux kernel. We show how BBR is integrated into the MP-DCCP multi-access framework and evaluate its performance over both single and multi-path environments. Our evaluation results show that BBR improves the performance compared to CCID2 (TCPlike Congestion Control) for multi-path scenarios due to the faster response to changes in the available bandwidth, which reduces latency and increases performance, especially for unreliable traffic. The MP-DCCP framework code, including the new CCID5 is available as OpenSource1.
|
|
| 2. |
- Pieskä, Marcus, 1985-, et al.
(författare)
-
Adaptive cheapest path first scheduling in a transport-layer multi-path tunnel context
- 2021
-
Ingår i: ANRW 2021 - Proceedings of the 2021 Applied Networking Research Workshop. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450386180 ; , s. 39-45
-
Konferensbidrag (refereegranskat)abstract
- Bundling multiple access technologies increases capacity, resiliency and robustness of network connections. Multi-access is currently being standardized in the ATSSS framework in 3GPP, supporting different access bundling strategies. Within ATSSS, a multipath scheduler needs to decide which path to use for each user packet based on path characteristics. The Cheapest Path First (CPF) scheduler aims to utilize the cheapest path (e.g. WiFi) before sending packets over other paths (e.g. cellular). In this paper, we demonstrate that using CPF with an MP-DCCP tunnel may lead to sub-optimal performance. This is due to adverse interactions between the scheduler and end-to-end and tunnel congestion control. Hence, we design the Adaptive Cheapest Path First (ACPF) scheduler that limits queue buildup in the primary bottleneck and moves traffic to the secondary path earlier. We implement ACPF over both TCP and DCCP congestion controlled tunnels. Our evaluation shows that ACPF improves the average throughput over CPF between 24% to 86%.
|
|
