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 very high accuracy. When fair queuing is detected, a different congestion control can be chosen, which can result in reduced latency. Unlike an algorithm proposed in a previous paper of us, the approach presented here does not only detect the presence of fair queuing once at flow startup but it does so continuously.
翻译:公平排队在互联网上越来越普遍,而且在许多情况下表现也越来越好。如果端点能够检测到公平排队在某条道路上的存在并相应调整其拥堵控制,那么绩效还可以提高。如果检测到公平的排队,那么,拥堵控制就不必考虑交叉交通,这允许更大的灵活性。在本文中,我们开发了第一个算法,在公平排队出现在一条道路上时,可以不断检查,而且精确度很高。在发现公平的排队时,可以选择不同的排队控制,这样可以降低耐用性。 与我们先前文件中提议的算法不同,这里介绍的方法不仅发现在流动启动时有公平的排队,而且这样做是持续的。