作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (8): 105-107. doi: 10.3969/j.issn.1000-3428.2008.08.036

• 安全技术 • 上一篇    下一篇

高速网络主动队列管理算法

苏凡军1,邬春学1,孙国强1,吕 勇2   

  1. (1. 上海理工大学计算机与电气工程学院,上海 200093;2. 嘉兴学院电子信息工程系,嘉兴 314001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-04-20 发布日期:2008-04-20

Active Queue Management Algorithm in High-speed Network

SU Fan-jun1, WU Chun-xue1, SUN Guo-qiang1, LV Yong2   

  1. (1. School of Computer and Electrical Engineering, University of Shanghai for Science and Technology, Shanghai 200093; 2. Department of Electronic Information Engineering, Jiaxing University, Jiaxing 314001 )
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-20 Published:2008-04-20

摘要: 在高速网络中,HRED算法使高速TCP流、普通TCP流和UDP流实现公平共享带宽。HRED利用RED队列的包丢失历史来识别高带宽流,通过对高带宽流进行惩罚,使低带宽流获取更多的带宽。HRED具有良好的扩展性,不需要保持每一流的状态信息。基于NS2的模拟实验证实,HRED可以在高速网络中实现更好的RTT公平性,有效地解决了适应流和非适应流共享带宽的问题。

关键词: 主动队列管理算法, 高速网络, 公平性

Abstract: HRED is designed to make high speed flows, regular TCP flows and UDP flows fairly share bandwidth in high-speed network. Using the packet drop history of RED, HRED identifies high-speed flows, and punishes high bandwidth flows to let the low bandwidth flows get more bandwidth. Per-flow state information is not needed, so HRED is scalable. Extensive simulations with NS2 show that HRED can realize better RTT fairness in high-speed networks, and can let responsive flows and non-responsive flows share bandwidth fairly.

Key words: active queue management algorithm, high-speed network, fairness

中图分类号: