【24h】

Fast Convergence of Congestion Control Algorithm

机译:充血控制算法的快速收敛性

获取原文

摘要

Traditional congestion control algorithms exhibit low convergence speed to equilibrium in high BDP (Bandwidth Delay Product) networks. The Fast Max-Min Kelly Control (FMKC) is a new and promising protocol that performs well especially in fairness convergence speed. FMKC utilizes packet loss to switch temporarily into a fairing mode and thereby improve the fairness convergence speed. In this paper, we investigate FMKC, prove its stability with homogeneous delay and also study the convergence behavior of FMKC. Extensive simulations show that FMKC offers faster convergence rate than EMKC. Simulations also show that FMKC preserves the good properties of EMKC, such as delay-independent stability and max-min fairness in steady state.
机译:传统的拥塞控制算法表现出低收敛速度在高BDP(带宽延迟产品)网络中的平衡。 FAST MAX-MIN KELLY控制(FMKC)是一种新的和有希望的协议,尤其是公平收敛速度。 FMKC利用数据包丢失将暂时切换成公平模式,从而提高公平收敛速度。在本文中,我们调查了FMKC,证明了其具有均匀延迟的稳定性,并研究了FMKC的收敛行为。广泛的模拟表明,FMKC提供比EMKC更快的收敛速度。模拟还表明,FMKC保留了EMKC的良好特性,例如延迟无关的稳定性和稳定状态的最大分线式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号