针对多类型网络服务的队列管理优化算法

Optimal Queue Management for Net Service

本文通过分析目前已有队列管理算法在应对不同类型网络服务中的局限性,在RED算法的基础上,给出了一种基于相对优先级的队列管理优化算法。针对网络中不同类型的数据业务,将其分为不同的优先级,并采用交错方式来设置不同的丢弃门限。并对所标注的数据分组,分别计算它们的平均队列长度。根据优先级、分组的平均队长和参数,计算不同优先级分组的丢弃概率。基于MATLAB的仿真结果表明,该优化算法大大改善了现有队列管理算法在面对不同类型网络服务中的公平性和相对优先级方面的问题。

In this paper, we analyze the limitation of several present queue management algorithms, and propose an optimal algorithm with relative PRI based on RED algorithm. We set different priority, and use interleaving way to decide different dropped packet threshold depending on all kinds of data service. Then, to the marked data packet we calculate their average queue length respectively, and figure out the dropped probability of different priority packet. Based on the simulation in MATLAB, it presents that this optimal algorithm improves the performance of queue management in terms of equity and relative priority in different kinds of network service.