PbRED:基于优先级的RED改进算法

PbRED:An improved RED algorithm based on priority

随机早期检测算法RED作为一种重要的主动队列管理算法,通过有效地控制队列长度,取得较好的吞吐量性能。然而,当多个业务流存在不同优先级时,不能很好地区分服务质量。提出一种新的RED改进算法—PbRED,基于业务的优先级调整丢弃概率,通过减小高优先级的丢弃概率、增大低优先级的丢弃概率,为不同优先级的业务进行区分服务。仿真实验结果表明,在获得较高吞吐量的同时,PbRED可以使不同优先级业务流的服务质量存在合理区分度,保证高优先级业务流获得更好的吞吐量性能。

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.