Achieving Fair Network Equilibria with Delay-based Congestion Control Algorithms
Miguel Rodr\'iguez-P\'erez, Sergio Herrer\'ia-Alonso, Manuel, Fern\'andez-Veiga, Andr\'es Su\'arez-Gonz\'alez, C\'andido, L\'opez-Garc\'ia

TL;DR
This paper introduces a novel server-side measurement algorithm for delay-based congestion control that ensures fairness between old and new connections without altering the control dynamics.
Contribution
A new measurement algorithm is proposed that maintains fairness in delay-based congestion control, operating solely on server-side local information without changing control dynamics.
Findings
The algorithm preserves fairness between old and new connections.
It operates entirely on server host using local measurements.
It improves fairness without modifying congestion control dynamics.
Abstract
Delay-based congestion control algorithms provide higher throughput and stability than traditional loss-based AIMD algorithms, but they are inherently unfair against older connections when the queuing and the propagation delay cannot be measured accurately and independently. This paper presents a novel measurement algorithm whereby fairness between old and new connections is preserved. The algorithm does not modify the dynamics of congestion control, and runs entirely in the server host using locally available information.
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.
