TY - GEN A1 - Rüth, Jan A1 - Kunze, Ike A1 - Hohlfeld, Oliver T1 - TCP's Initial Window - Deployment in the Wild and its Impact on Performance T2 - IEEE Transactions on Network and Service Management Y1 - 2019 UR - https://ieeexplore.ieee.org/document/8629948 U6 - https://doi.org/10.1109/TNSM.2019.2896335 SN - 1932-4537 SN - 2373-7379 VL - 16 IS - 2 SP - 389 EP - 402 ER - TY - GEN A1 - Rüth, Jan A1 - Kunze, Ike A1 - Hohlfeld, Oliver T1 - An Empirical View on Content Provider Fairness T2 - Proceedings of the Network Traffic Measurement and Analysis Conference (TMA '19), June 17-21, 2019, Paris, France Y1 - 2019 UR - https://arxiv.org/abs/1905.07152 U6 - https://doi.org/10.23919/TMA.2019.8784684 PB - IFIP/IEEE ER - TY - GEN A1 - Kunze, Ike A1 - Rüth, Jan A1 - Hohlfeld, Oliver T1 - Congestion Control in the Wild - Investigating Content Provider Fairness T2 - IEEE Transactions on Network and Service Management N2 - Congestion control (CC) is an indispensable com-ponent of transport protocols to prevent congestion collapseas it distributes the available bandwidth among all competingflows, ideally in a fair manner. It thus has a large impact onperformance and there exists a constantly evolving set of CCalgorithms, each addressing different performance needs. Whilethe algorithms are commonly tested regarding the problemsunderlying their implementation, the interaction with existingalgorithms is often not considered. Additionally considering thefact that content providers (CPs) such as content distributionnetworks (CDNs) are known to tune TCP stacks for performancegains, the large assortment of algorithms opens the door for cus-tom parametrization and potentially unfair bandwidth sharing.In this paper, we thus empirically investigate if current Internettraffic generated by CPs still adheres to the conventional under-standing of fairness. For this, we compare fairness propertiesof testbed hosts to actual traffic of six major CPs subject todifferent queue sizes and queueing disciplines in a home-usersetting. Additionally, we investigate how mice and elephant flowsfrom the different CPs interact. We find that some employedCC algorithms lead to significantly asymmetric bandwidth sharesand very poor flow completion times for mice flows. Fortunately,AQMs such as FQ_CoDel are able to alleviate such unfairness. KW - TCP congestion control KW - Measurements KW - Contentdistribution networks Y1 - 2020 U6 - https://doi.org/10.1109/TNSM.2019.2962607 SN - 1932-4537 VL - 17 IS - 2 SP - 1224 EP - 1238 ER -