Interactions between Congestion Control Algorithms
B. Turkovic (TU Delft - Embedded Systems)
F.A. Kuipers (TU Delft - Embedded Systems)
Steve Uhlig (Queen Mary University of London)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
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.