Performance Analysis of Dynamic Equilibria in Joint Path Selection and Congestion Control in Path-Aware Networks
Sina Keshvadi

TL;DR
This paper analyzes the stability and performance trade-offs in joint path selection and congestion control in path-aware networks, providing insights and guidelines for robust multipath transport.
Contribution
It introduces a discrete-time axiomatic framework to quantify the dynamics and trade-offs of load oscillations in path-aware networks, revealing conditions for stability and efficiency.
Findings
High responsiveness improves fairness but reduces efficiency and convergence.
A critical lossless operating point allows simultaneous achievement of efficiency, convergence, and loss avoidance.
Limited visibility constraints can cause persistent load imbalance despite high path diversity.
Abstract
Path-aware networking (PAN) architectures, such as SCION and emerging LEO constellations, expose tens to hundreds of verifiable paths to endpoints. When multipath protocols like MPTCP and MPQUIC greedily exploit this diversity, uncoordinated migration can induce persistent, high-amplitude load oscillations. Although this instability is well-known, its quantitative performance impact remains poorly understood. In this paper, we apply a discrete-time axiomatic framework to the joint dynamics of loss-based congestion control and greedy path selection. By deriving the system's dynamic equilibria (stable periodic oscillations), we prove a fundamental trade-off: high Responsiveness improves Fairness but necessarily degrades Efficiency and Convergence. Conversely, we demonstrate that Efficiency, Convergence, and Loss Avoidance are simultaneously achievable at a critical lossless operating…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
