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

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

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

CLC Number: 

• TP393