论文标题
检测公平排队以进行更好的拥塞控制
Detecting Fair Queuing for Better Congestion Control
论文作者
论文摘要
对于云游戏和视频会议等应用程序，低延迟是明确的要求。基于延迟的拥塞控制可以达到相同的吞吐量，但延迟明显小于基于损失的延迟，因此对于这些应用来说是理想的选择。但是，当延迟和基于损失的流程竞争瓶颈时，基于损耗的流程可以垄断所有带宽，并饿死基于延迟的损失。通过在瓶颈链接上排队的公平排队可以通过为每个流量分配相等的可用带宽份额来解决此问题。但是，到目前为止，尚无基于宿主的算法来检测公平排队的存在。我们的贡献是开发一种算法，该算法检测流量启动时的公平排队，并在排队时选择基于延迟的拥塞控制。否则，基于损失的拥塞控制可以用作备用选项。结果表明，我们的算法可靠地检测到公平排队，并可以在检测到公平排队的情况下实现低延迟和高吞吐量。
Low delay is an explicit requirement for applications such as cloud gaming and video conferencing. Delay-based congestion control can achieve the same throughput but significantly smaller delay than loss-based one and is thus ideal for these applications. However, when a delay- and a loss-based flow compete for a bottleneck, the loss-based one can monopolize all the bandwidth and starve the delay-based one. Fair queuing at the bottleneck link solves this problem by assigning an equal share of the available bandwidth to each flow. However, so far no end host based algorithm to detect fair queuing exists. Our contribution is the development of an algorithm that detects fair queuing at flow startup and chooses delay-based congestion control if there is fair queuing. Otherwise, loss-based congestion control can be used as a backup option. Results show that our algorithm reliably detects fair queuing and can achieve low delay and high throughput in case fair queuing is detected.
