关键词: 主动队列管理, 随机早期检测算法, 优先级, 队列长度, 吞吐量

Abstract:

As an important active

queue management algorithm, Random Early Detection (RED) obtains a desirable throughput

performance and keeps a stable queue length. However, when there are distinct priorities among

different traffics, it cannot differentiate the QoS of the traffics. A novel improved RED

algorithm, called PbRED, is proposed by adjusting the dropprobability based on priorities. By

decreasing the dropprobability of higher priority and vice versa, PbRED provides

differentiated QoS for traffics with different priorities. The simulation results show that

besides maintaining a higher total throughput, PbRED can provide reasonable differentiated QoS

for traffics with different priorities and can guarantee that the traffic with a higher

priority gets a better throughput performance.Key words:active queue management;RED

algorithm;priority;queue length;throughput