Interactions between Congestion Control Algorithms

Interactions between Congestion Control Algorithms

Turkovic, B. (TU Delft Embedded Systems)
Kuipers, F.A. (TU Delft Embedded Systems)
Uhlig, Steve (Queen Mary University of London)

Secci, S. (editor)
Chrisment, I. (editor)
Fiore, M. (editor)
Tabourier, L. (editor)
Lim, K.W. (editor)

2019

Congestion control algorithms are crucial in achieving high utilization while preventing overloading the network. Over the years, many different congestion control algorithms have been developed, each trying to improve over others in
specific situations. However, their interactions and co-existence has, to date, not been thoroughly evaluated, which is the focus of this paper. Through head-to-head comparisons of loss-based, delay-based and hybrid types of congestion control algorithms, we reveal that fairness in resources claimed is often not achieved,
especially when flows sharing a link have different round-trip times or belong to different groups.

http://resolver.tudelft.nl/uuid:7cc9b134-7c4c-49b6-bb6f-9aa4e0f70e57

https://doi.org/10.23919/TMA.2019.8784674

IEEE

978-1-5386-7372-0

2019 Network Traffic Measurement and Analysis Conference (TMA): Proceedings of the 3rd Network Trac Measurement and Analysis Conference

TMA 2019: 3rd Network Traffic Measurement and Analysis Conference, 2019-06-19 → 2019-06-21, Paris, France

Institutional Repository

conference paper

© 2019 B. Turkovic, F.A. Kuipers, Steve Uhlig