Print Email Facebook Twitter Slowdown as a Metric for Congestion Control Fairness Title Slowdown as a Metric for Congestion Control Fairness Author Zapletal, A. (TU Delft Networked Systems) Kuipers, F.A. (TU Delft Networked Systems) Date 2023 Abstract The conventional definition of fairness in congestion control is flow rate fairness. However, Internet users typically care about flow completion times (FCTs) and flow rate fairness does not lead to equitable FCTs for different users. Therefore, we reconsider what it means for congestion control to be fair and posit a novel stance on fairness: it is fair when no flow unnecessarily prolongs another flow. Based on this stance, we propose an evaluation framework for congestion control fairness that uses slowdown (normalized FCT) as the metric.We demonstrate the usefulness of our framework through surprising experiment results: in theory, prioritizing short flows should outperform fair queueing, but we show that this is not the case due to slow start dominating short flows. The framework can also analyze traditional flow rate fairness; we do so and verify well-known "fairness" issues, but additionally, we show that flow rate unfairness does not induce slowdown and is thus not a problem per se. To reference this document use: http://resolver.tudelft.nl/uuid:be984539-71d5-4c4e-a9cc-bae6c77d3130 DOI https://doi.org/10.1145/3626111.3628185 Publisher Association for Computing Machinery (ACM) ISBN 9798400704154 Source HotNets 2023 - Proceedings of the 22nd ACM Workshop on Hot Topics in Networks Series HotNets 2023 - Proceedings of the 22nd ACM Workshop on Hot Topics in Networks Part of collection Institutional Repository Document type conference paper Rights © 2023 A. Zapletal, F.A. Kuipers Files PDF 3626111.3628185.pdf 902.02 KB Close viewer /islandora/object/uuid:be984539-71d5-4c4e-a9cc-bae6c77d3130/datastream/OBJ/view