期刊检索

  • 2019年第51卷
  • 2018年第50卷
  • 2017年第49卷
  • 2016年第48卷
  • 2015年第47卷
  • 2014年第46卷
  • 2013年第45卷
  • 2012年第44卷
  • 2011年第43卷
  • 2010年第42卷
  • 第1期
  • 第2期

主管单位 中华人民共和国
工业和信息化部
主办单位 哈尔滨工业大学 主编 冷劲松 国际刊号ISSN 0367-6234 国内刊号CN 23-1235/T

期刊网站二维码
微信公众号二维码
引用本文:董瀚泽,郭志川.BBR拥塞控制算法在无线网络中的性能改进[J].哈尔滨工业大学学报,2019,51(11):63.DOI:10.11918/j.issn.0367-6234.201901020
DONG Hanze,GUO Zhichuan.Performance improvement of BBR congestion control algorithm in wireless network[J].Journal of Harbin Institute of Technology,2019,51(11):63.DOI:10.11918/j.issn.0367-6234.201901020
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  下载PDF阅读器  关闭
过刊浏览    高级检索
本文已被:浏览 237次   下载 178 本文二维码信息
码上扫一扫!
分享到: 微信 更多
BBR拥塞控制算法在无线网络中的性能改进
董瀚泽1,2,郭志川1,2
(1.中国科学院声学研究所国家网络新媒体工程技术研究中心, 北京 100190; 2.中国科学院大学, 北京 100049)
摘要:
传统的拥塞控制算法已经不能满足当前复杂的网络环境,谷歌提出的BBR算法(Bottleneck Bandwidth and Round-Trip)为拥塞控制提供了一种新思路,它可以在具有一定丢包率的网络链路上充分利用带宽,并保证较低的时延.但是该算法存在以下问题:首先,当无线网络的时延剧烈抖动时,BBR具有很低的传输速率,即便网络不丢包且此时未发生拥塞,这一问题在以往的论文中还没有人提出过;其次,BBR对网络带宽的降低不够敏感.本文详细分析以上问题出现的原因,进而提出改进BBR算法:通过比较RTT的均值和标准差判断网络时延的抖动程度,在时延抖动很剧烈时,使用RTT的均值取代最小RTT来计算拥塞窗口;在网络不稳定时,降低PROBE_BW状态中平稳阶段的时间长度.在实际网络中的实验表明,改进后的BBR算法几乎不受时延波动的影响,随着时延波动程度的提高,改进后算法的传输速率基本保持不变,在BBR几乎不能工作时仍能保持正常的传输速率;而且改进后的BBR算法在网络不稳定时能够更快地探测到网络带宽的降低并收敛.
关键词:  BBR优化  拥塞控制  无线网络  收敛速率
DOI:10.11918/j.issn.0367-6234.201901020
分类号:TP393.06
文献标识码:A
基金项目:国家科技重大专项“新一代宽带无线移动通信网”子课题“5G与信息中心网络(ICN)融合技术研发”(2017ZX03001019)
Performance improvement of BBR congestion control algorithm in wireless network
DONG Hanze1,2,GUO Zhichuan1
(1.National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China; 2. University of Chinese Academy of Sciences, Beijing 100049, China)
Abstract:
Since traditional congestion control algorithm cannot fulfill the requirements of current complex networks, Google provides a new way named bottleneck bandwidth and round-trip (BBR) for congestion control. The purpose of BBR is to maximize throughput and minimize delay on a bottleneck link with packet loss, but it has some disadvantages: First, when the delay of wireless network is severely jittered, even if there is no packet loss or congestion, the delivery rate of BBR is very low. This issue has not been raised in previous studies. Second, BBR is not sensitive enough to the bandwidth drop. This paper analyzes the causes of the above problems in detail and proposes an optimized BBR, which can judge the jitter degree of network by comparing the mean and standard deviation of RTT. When the jitter of delay was severe, the mean RTT was used instead of minimum RTT to calculate congestion window. When the network was unstable, the length of stationary phase in PROBE_BW was reduced. Experiments in the real network showed that the optimized BBR was almost unaffected by delay fluctuations, and could maintain high bandwidth utilization when BBR could hardly work. Besides, it could detect bandwidth degradation and converge faster than BBR when the network was unstable.
Key words:  optimization of bottleneck bandwidth and round-trip time  congestion control  wireless network  convergence rate

友情链接LINKS