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.
翻译:低延迟是云游戏和视像会议等应用程序的明确要求。 延迟阻塞控制可以实现相同的吞吐量,但比以损失为基础的延迟要少得多,因此对于这些应用程序来说是理想的。 但是,当延迟和以损失为基础的流量争夺瓶颈时,以损失为基础的流量可以垄断所有带宽,使以延迟为基础的带宽挨饿。 公平排队在瓶颈连接处通过为每流量分配同等比例的可用带宽来解决这个问题。 但是,到目前为止,还没有基于终端的宿主算法来检测公平的排队。 我们的贡献是开发一种算法,在流量启动时能够发现公平的排队排队,并在有公平的排队的情况下选择以延迟为基础的堵塞控制。 否则,以损失为基础的阻塞控制可以作为一种备用选项。 结果显示,我们的算法可靠地探测了公平的排队排队,可以实现低的延迟和高的排队投入。