Anhui Provincial Key Laboratory of Photonic Devices and Materials, Anhui Institute of Optics and Fine Mechanics, HFIPS, Chinese Academy of Sciences, Hefei 230031, China.
University of Science and Technology of China, Hefei 230026, China.
Sensors (Basel). 2023 Apr 30;23(9):4431. doi: 10.3390/s23094431.
In 2016, Google proposed a congestion control algorithm based on bottleneck bandwidth and round-trip propagation time (BBR). The BBR congestion control algorithm measures the network bottleneck bandwidth and minimum delay in real-time to calculate the bandwidth delay product (BDP) and then adjusts the transmission rate to maximize throughput and minimize latency. However, relevant research reveals that BBR still has issues such as RTT unfairness, high packet loss rate, and deep buffer performance degradation. This article focuses on its most prominent RTT fairness issue as a starting point for optimization research. Using fluid models to describe the data transmission process in BBR congestion control, a fairness optimization strategy based on pacing gain is proposed. Triangular functions, inverse proportional functions, and gamma correction functions are analyzed and selected to construct the pacing gain model, forming three different adjustment functions for adaptive adjustment of the transmission rate. Simulation and real experiments show that the three optimization algorithms significantly improve the fairness and network transmission performance of the original BBR algorithm. In particular, the optimization algorithm that employs the gamma correction function as the gain model exhibits the best stability.
2016 年,谷歌提出了一种基于瓶颈带宽和往返传播时间(BBR)的拥塞控制算法。BBR 拥塞控制算法实时测量网络瓶颈带宽和最小延迟,计算带宽延迟产品(BDP),然后调整传输速率以最大化吞吐量并最小化延迟。然而,相关研究表明,BBR 仍然存在 RTT 不公平、高丢包率和深缓冲区性能下降等问题。本文以其最突出的 RTT 公平性问题为切入点进行优化研究。使用流体模型来描述 BBR 拥塞控制中的数据传输过程,提出了一种基于 pacing gain 的公平性优化策略。分析并选择了三角函数、反比例函数和伽马校正函数来构建 pacing gain 模型,形成了三个不同的调整函数,用于自适应调整传输速率。仿真和真实实验表明,这三种优化算法显著提高了原始 BBR 算法的公平性和网络传输性能。特别是,采用伽马校正函数作为增益模型的优化算法表现出最佳的稳定性。