首页> 中文期刊> 《通信学报》 >公平和低时延的主动队列管理算法研究

公平和低时延的主动队列管理算法研究

         

摘要

因特网中时延敏感应用和高吞吐量应用的流行使路由器和交换机中的缓存越来越大,导致网络流量极易出现高时延和高抖动率.基于高带宽非响应流的移动应用的普及使网络瓶颈资源利用愈加失衡,整个网络的资源分配公平性难以得到保证.为了缓解这2个问题,从时延控制和抑制高带宽非响应流抢占资源的角度,基于Sample-Match、L-LRU缓存和按概率分组丢失机制,提出了兼顾公平和低时延的主动队列管理(FLDA)算法.实验结果表明,在高带宽非响应流的干扰下,FLDA能够较好地维持队列稳定性、瓶颈链路资源利用的公平性和低时延性.%The popularity of delay sensitive applications and high throughput applications in the Internet made the caches of routers and switches larger,resulting in the high latency and high jitter rate of network traffic.With the growth of mobile applications based on the high bandwidth non-response flows,the network bottleneck resource utilization becomes more unbalanced,and the resources distribution of the whole network was difficult to be guaranteed.In order to alleviate these problems,considering the delay control and suppression of high bandwidth non-response flow,an active queue management algorithm focusing on fairness and low delay named FLDA was proposed based on Sample-Match,L-LRU cache and probabilistic packets dropping.Experimental results show that under the interference with high bandwidth non-responsive flows,FLDA can better maintain the queue stability,the fairness of resource utilization of the bottleneck link and the low delay.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号