Uploaded June 2026 | Updated September 2026, 3 weeks ago
FRCC: Towards Provably Fair and Robust Congestion Control
Anup Agarwal, Carnegie Mellon University; Venkat Arun, University of Texas at Austin; Srinivasan Seshan, Carnegie Mellon University
Congestion control algorithms (CCAs) play a critical role in network bandwidth allocation. Recent work (from SIGCOMM 2022) showed that a large class of CCAs, including BBR, Copa, and Reno, starve flows in the presence of network jitter. Starvation occurs because CCAs coordinate fairness by encoding fair rates into congestion signals. For example, Reno's throughput scales as 1/√loss rate. Even a small amount of noise in these signals leads to large errors in inferring fair rates. We present FRCC (Fair and Robust Congestion Controller), the first CCA that provably bounds unfairness (avoids starvation) even under network jitter. Our key insight is to encode only the flow count (or equivalently, the fair link fraction) into the congestion signals, and independently estimate the link capacity to calculate the fair rate. In this way, we bound jitter's impact on fairness. We implement FRCC in the Linux kernel and evaluate it in a variety of network conditions, including synthetic jitter, heterogeneous RTTs, and multi-bottleneck settings. FRCC closely matches the bounds predicted by our theoretical analysis, and consistently achieves fairness, even when state-of-the-art CCAs exhibit starvation.
View the full NSDI '26 program at usenix.org/conference/nsdi26/technical-sessions
FRCC: Towards Provably Fair and Robust Congestion Control
Anup Agarwal, Carnegie Mellon University; Venkat Arun, University of Texas at Austin; Srinivasan Seshan, Carnegie Mellon University
Congestion control algorithms (CCAs) play a critical role in network bandwidth allocation. Recent work (from SIGCOMM 2022) showed that a large class of CCAs, including BBR, Copa, and Reno, starve flows in the presence of network jitter. Starvation occurs because CCAs coordinate fairness by encoding fair rates into congestion signals. For example, Reno's throughput scales as 1/√loss rate. Even a small amount of noise in these signals leads to large errors in inferring fair rates. We present FRCC (Fair and Robust Congestion Controller), the first CCA that provably bounds unfairness (avoids starvation) even under network jitter. Our key insight is to encode only the flow count (or equivalently, the fair link fraction) into the congestion signals, and independently estimate the link capacity to calculate the fair rate. In this way, we bound jitter's impact on fairness. We implement FRCC in the Linux kernel and evaluate it in a variety of network conditions, including synthetic jitter, heterogeneous RTTs, and multi-bottleneck settings. FRCC closely matches the bounds predicted by our theoretical analysis, and consistently achieves fairness, even when state-of-the-art CCAs exhibit starvation.
View the full NSDI '26 program at usenix.org/conference/nsdi26/technical-sessions
