Uni-MPTCP(ω ,n): a Unified MPTCP Congestion Control Algorithm

A fundamental design principle of MultiPath TCP (MPTCP) congestion control algorithm (CCA) is that an MPTCP flow should be fair to and do not harm TCP flows. Unfortunately, to deal with cost heterogeneity among subflow interfaces, the existing cost-aware MPTCP CCAs often violate this design principle in an attempt to minimize the cost. Based on the network utility maximization (NUM) framework, we put forward UniMPTCP($\vec \omega $,n), a NUM-optimal, Unified MPTCP CCA with n subflow paths and a n-dimension weight vector $\vec \omega $ with n −1 independent elements. Uni-MPTCP($\vec \omega $,n) abides by this design principle for arbitrary $\vec \omega $ and can be customized to achieve specific cost design objectives with proper adaptation of $\vec \omega $. As such, UniMPTCP($\vec \omega $,n) provides a unified solution to enable cost-aware MPTCP CCAs, while adhering to the design principle. Finally, we put forward an adaptation algorithm for, ω, in Uni-MPTCP(ω,2), aiming at maintaining a target MPTCP flow rate with minimum cost for a cost-heterogeneity case with dual connectivity. The test results based on NS-3 simulation demonstrate that UniMPTCP(ω,2) can indeed effectively keep track of a given flow rate target with minimum cost, while adhering to the design principle.

Authors

Institutions

Publication Details

Published
2025-09-15
DOI
https://doi.org/10.1109/lcn65610.2025.11146380
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Uni-MPTCP(ω ,n): a Unified MPTCP Congestion Control Algorithm

Hong Jiang, Xuan Wang, Zhijun Wang, Hao Che
Network Traffic and Congestion Control
article

Uni-MPTCP(ω ,n): a Unified MPTCP Congestion Control Algorithm

Hong Jiang, Xuan Wang, Zhijun Wang, Hao Che
article en

Abstract

A fundamental design principle of MultiPath TCP (MPTCP) congestion control algorithm (CCA) is that an MPTCP flow should be fair to and do not harm TCP flows. Unfortunately, to deal with cost heterogeneity among subflow interfaces, the existing cost-aware MPTCP CCAs often violate this design principle in an attempt to minimize the cost. Based on the network utility maximization (NUM) framework, we put forward UniMPTCP($\vec \omega $,n), a NUM-optimal, Unified MPTCP CCA with n subflow paths and a n-dimension weight vector $\vec \omega $ with n −1 independent elements. Uni-MPTCP($\vec \omega $,n) abides by this design principle for arbitrary $\vec \omega $ and can be customized to achieve specific cost design objectives with proper adaptation of $\vec \omega $. As such, UniMPTCP($\vec \omega $,n) provides a unified solution to enable cost-aware MPTCP CCAs, while adhering to the design principle. Finally, we put forward an adaptation algorithm for, ω, in Uni-MPTCP(ω,2), aiming at maintaining a target MPTCP flow rate with minimum cost for a cost-heterogeneity case with dual connectivity. The test results based on NS-3 simulation demonstrate that UniMPTCP(ω,2) can indeed effectively keep track of a given flow rate target with minimum cost, while adhering to the design principle.

The University of Texas at Arlington (US)
Openalex Percentile: Top 72%
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.

Uni-MPTCP(ω ,n): a Unified MPTCP Congestion Control Algorithm — Hong Jiang, Xuan Wang, et al. · (2025) | TGRS Research Map | TGRS