节点文献

PRED:一种具有优先级自适应的队列管理新算法

PRED:A New Queue Management Algorithm with Priority and Self-Adaptation

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 张克平田辽李增智

【Author】 ZHANG Ke-ping,TIAN Liao,LI Zeng-zhi (Institute of Computer Architecture & Network, Xi’an Jiaotong University,Xi’an,Shannxi 710049,China)

【机构】 西安交通大学计算机系统结构与网络研究所西安交通大学计算机系统结构与网络研究所 陕西西安710049陕西西安710049陕西西安710049

【摘要】 现有的拥塞控制采用以TCP为核心的基于窗口技术的端到端控制 ,具有丢包、响应速度慢等缺陷 .本文提出的基于优先级的队列管理算法 (PRED) ,使路由器更加精确地管理队列 ,算法的主要参数能够适应网络负载的动态变化 ,有效地克服了现有拥塞控制的缺陷 .实验结果表明 ,在相同的配置下 ,采用PRED的网络在降低丢包率、减少队列抖动等性能上均优于端到端拥塞控制 .

【Abstract】 With various multimedia applications rapidly advanced in the current INTERNET,the frequent occurrence of congestion has led many researchers to re-examine the issue of congestion control.At present,the congestion control technologies we master and use adopt end-to-end control which regards TCP as core and is based on window.However,this art has its own drawbacks such as high packet loss,low response speed etc.In this study,the authors give a queue managing algorithm based on priority and self-adaptation.The algorithm is called Priority Random Early Detection (PRED).The algorithm can make router more accurately schedule queue.The primary parameter of algorithm can adapt dynamic change of network load in true surroundings.Validly,it avoids the drawbacks of congestion control we master.Experiments prove,under the same configurations,that PRED algorithm is better than end-to-end congestion control arts in terms of reducing the rate of packet loss and oscillation of queue.

【关键词】 队列管理优先级RED自适应
【Key words】 queue managepriorityREDself-adaptation
【基金】 国家 8 63(No.863 51 1 946 0 0 8,No.2 0 0 1ba2 0 1a33) ;宁夏自然科学基金 (No.F0 0 1 )
  • 【文献出处】 电子学报 ,Acta Electronica Sinica , 编辑部邮箱 ,2004年06期
  • 【分类号】TP39307
  • 【被引频次】17
  • 【下载频次】182
节点文献中: 

本文链接的文献网络图示:

本文的引文网络