论文标题
TCP D*：低潜伏期第一拥塞控制算法
TCP D*: A Low Latency First Congestion Control Algorithm
论文作者
论文摘要
长期以来，在TCP拥塞控制中，延迟和数据包丢失之间的反馈机制的选择一直是争论的点。这部分已得到解决，因为越来越明显地，需要基于延迟的方法来促进现代交互式Web应用程序。但是，尚未解决的是应该使用哪种控制，两个候选人是拥塞窗口和起搏率。 BBR是一种新的基于延迟的拥塞控制算法，它使用起搏速率作为其主要控制，将拥塞窗口作为次要控制。我们建议，在必须将延迟最小化的情况下，即使以某些吞吐量损失，也必须最小化延迟的情况下，首先是拥塞窗口的第一算法。为了评估这一假设，我们介绍了一种称为TCP D*的新的拥塞控制算法，这是一种拥塞窗口的第一算法，该算法采用了BBR最大化输送率的方法，同时最大程度地减少了延迟。在本文中，我们讨论了该算法的关键特征，讨论与BBR的差异和相似性，并根据实际实现提供了一些初步结果。
The choice of feedback mechanism between delay and packet loss has long been a point of contention in TCP congestion control. This has partly been resolved, as it has become increasingly evident that delay based methods are needed to facilitate modern interactive web applications. However, what has not been resolved is what control should be used, with the two candidates being the congestion window and the pacing rate. BBR is a new delay based congestion control algorithm that uses a pacing rate as its primary control and the congestion window as a secondary control. We propose that a congestion window first algorithm might give more desirable performance characteristics in situations where latency must be minimized even at the expense of some loss in throughput. To evaluate this hypothesis we introduce a new congestion control algorithm called TCP D*, which is a congestion window first algorithm that adopts BBR's approach of maximizing delivery rate while minimizing latency. In this paper, we discuss the key features of this algorithm, discuss the differences and similarity to BBR, and present some preliminary results based on a real implementation.
