Design Rules for Low-Latency Multipath Congestion Control

We first study optimal congestion control from a theoretical perspective. Concretely, we consider a system that optimizes the sum of the utilities of all the users, in which the users are allowed to send their traffic over different paths over the network and derive design rules that optimal (low-latency) multipath congestion control needs to follow. Because, as it turns out that optimal congestion control requires coordination between the network nodes, and hence, is hard to implement, we investigate how to approximate its performance with algorithms in which (i) the network nodes make independent decisions and (ii) coordination is only allowed between the subflows that belong to the same user. Therefore, these design rules need to be slightly relaxed. We compare the performance of these realistic algorithms with the optimal algorithm. We also investigate to what extent the algorithms that are currently defined and are being defined in the Internet Engineering Task Force (IETF), in particular, (i) Prague congestion control (i.e., congestion control based on Accurate Explicit Congestion Notification (AccECN) marks) and (ii) a variant of a loss-based multipath congestion control algorithm, adhere to these rules.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20766
Primary Topic
Network Traffic and Congestion Control
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Design Rules for Low-Latency Multipath Congestion Control

Chia‐Yu Chang, Simone Bolettieri, Koen De Schepper, Danny De Vleeschauwer
arXiv (Cornell University)
Network Traffic and Congestion Control
preprint

Design Rules for Low-Latency Multipath Congestion Control

Chia‐Yu Chang, Simone Bolettieri, Koen De Schepper, Danny De Vleeschauwer
preprint en

Abstract

We first study optimal congestion control from a theoretical perspective. Concretely, we consider a system that optimizes the sum of the utilities of all the users, in which the users are allowed to send their traffic over different paths over the network and derive design rules that optimal (low-latency) multipath congestion control needs to follow. Because, as it turns out that optimal congestion control requires coordination between the network nodes, and hence, is hard to implement, we investigate how to approximate its performance with algorithms in which (i) the network nodes make independent decisions and (ii) coordination is only allowed between the subflows that belong to the same user. Therefore, these design rules need to be slightly relaxed. We compare the performance of these realistic algorithms with the optimal algorithm. We also investigate to what extent the algorithms that are currently defined and are being defined in the Internet Engineering Task Force (IETF), in particular, (i) Prague congestion control (i.e., congestion control based on Accurate Explicit Congestion Notification (AccECN) marks) and (ii) a variant of a loss-based multipath congestion control algorithm, adhere to these rules.

arXiv (Cornell University)
Network Traffic and Congestion Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon