论文标题
公平排队有意识的拥塞控制
Fair Queuing Aware Congestion Control
论文作者
论文摘要
公平的排队在互联网上变得越来越普遍，并且在许多情况下已被证明可以提高性能。如果终点可以检测到一定路径上的公平排队并相应地调整其拥塞控制，则可以进一步提高性能。如果检测到公平的排队，则拥塞控制不必考虑交叉流量，这可以提高灵活性。在本文中，我们开发了第一种算法，该算法不断检查路径上是否存在公平排队，精度超过95％。当检测到公平排队时，可以选择不同的拥塞控制，这可能会导致延迟减少。同样，每个流都可以指定其允许的排队延迟，这意味着它可以选择吞吐量和延迟之间的权衡。
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.
