Fair queuing is becoming increasingly prevalent in the internet and has been shown to improve performance in many circumstances. Performance could be improved even more if endpoints could detect the presence of fair queuing on a certain path and adjust their congestion control accordingly. If fair queuing is detected, the congestion control would not have to take cross traffic into account, which allows for more flexibility. In this paper, we develop the first algorithm that continuously checks if fair queuing is present on a path, with an accuracy of over 95%. When fair queuing is detected, a different congestion control can be chosen, which can result in reduced latency. Also, each flow can then specify how much queuing delay it allows, meaning that it can choose its own tradeoff between throughput and latency.
翻译:公平排队在互联网上越来越普遍,而且在许多情况下表现也越来越好。如果端点能够检测到公平排队在某条道路上的存在并相应调整其拥堵控制,那么绩效还可以提高。如果发现了公平的排队,那么,堵塞控制就不必考虑交叉交通,这允许更大的灵活性。在本文中,我们开发了第一个算法,在公平的排队出现在一条道路上时不断检查,准确率超过95%。在发现公平的排队时,可以选择不同的拥堵控制,这样可以降低延时率。此外,每种流量都可以具体说明排队的延迟允许多少,这意味着它可以选择自己在排队和排队之间的权衡。