Revisiting TCP congestion control throughput models & fairness properties at scale
Revisiting TCP congestion control throughput models & fairness properties at scale
复制标题
DOI:
10.1145/3487552.3487834
复制
发表时间:
2021-11
期刊:
影响因子:
--
通讯作者:
Adithya Abraham Philip;Ranysha Ware;Rukshani Athapathu;Justine Sherry;Vyas Sekar
中科院分区:
文献类型:
--
作者:
Adithya Abraham Philip;Ranysha Ware;Rukshani Athapathu;Justine Sherry;Vyas Sekar
Much of our understanding of congestion control algorithm (CCA) throughput and fairness is derived from models and measurements that (implicitly) assume congestion occurs in the last mile. That is, these studies evaluated CCAs in "small scale" edge settings at the scale of tens of flows and up to a few hundred Mbps bandwidths. However, recent measurements show that congestion can also occur at the core of the Internet on inter-provider links, where thousands of flows share high bandwidth links. Hence, a natural question is: Does our understanding of CCA throughput and fairness continue to hold at the scale found in the core of the Internet, with 1000s of flows and Gbps bandwidths? Our preliminary experimental study finds that some expectations derived in the edge setting do not hold at scale. For example, using loss rate as a parameter to the Mathis model to estimate TCP NewReno throughput works well in edge settings, but does not provide accurate throughput estimates when thousands of flows compete at high bandwidths. In addition, BBR - which achieves good fairness at the edge when competing solely with other BBR flows - can become very unfair to other BBR flows at the scale of the core of the Internet. In this paper, we discuss these results and others, as well as key implications for future CCA analysis and evaluation.