Towards Provably Performant Congestion Control

Explore a 17-minute conference talk from NSDI '24 that delves into the development of provably performant congestion control algorithms (CCAs). Learn about a framework designed to simplify the creation of CCAs capable of functioning effectively across diverse network scenarios, including cellular links, policers, token bucket filters, and operating system jitter. Discover the necessary actions required for any high-performing CCA and the sufficient information needed to determine sending rates. Gain insights into how this framework, combined with formal methods techniques, enables the synthesis of CCAs with proven performance across various network conditions. Understand the fundamental impossibility results uncovered through this research methodology, presented by experts from Carnegie Mellon University and the University of Texas at Austin.