POSTER: Expanding the Design Space for in-Network Congestion Control on the Internet
Open Access
- 4 August 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 42-44
Abstract
The Internet has historically been built on the assumption of a smart edge and a dumb network. This design philosophy is also reflected in end-to-end Internet congestion control. The stability and general fairness of the current Internet are heavily reliant on end hosts implementing congestion control algorithms (CCAs) correctly. Maintaining fairness between flows on the Internet with end-host-based algorithms is a hard problem. Even when the Internet was dominated by a homogeneous mix of loss-based AIMD CCAs, unfairness was an issue between flows with different RTTs [11]. While some delay-based algorithms were able to achieve RTT fairness, they became susceptible to unfairness arising from a late-comer advantage [1].Keywords
Funding Information
- Ministry of Education, Singapore (MOE-T2EP20222-0006)
This publication has 13 references indexed in Scilit:
- Keeping an Eye on Congestion Control in the Wild with Nebby2024
- Continuous in-network round-trip time monitoring2022
- Cebinae2022
- On the Future of Congestion Control for the Public Internet2020
- Beyond Jain's Fairness Index2019
- Modeling BBR's Interactions with Loss-Based Congestion Control2019
- A Survey of Delay-Based and Hybrid TCP Congestion Control AlgorithmsIEEE Communications Surveys & Tutorials, 2019
- Experimental evaluation of BBR congestion control2017
- BBR: Congestion-Based Congestion ControlQueue, 2016
- Tackling bufferbloat in 3G/4G networks2012