摘要： 描述了紧急度轮循分组调度算法和基于网络处理器高效的实现方法。基于紧急度的分组调度算法尽可能选出当前各流中最需要被服务的队列。在Intel IXP2400 网络处理器实现中采用多层次位向量和紧急度索引表等特殊的方式以提高系统的效率。最后与传统的RR 和WRR 比较，给出了算法的仿真结果，并对算法将来的扩展进行了展望。

关键词: 网络处理器；QoS；微引擎；调度算法；位向量

Abstract: This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bitvector and urgency index table for performance and finally offers the future research on the algorithm

Key words: Network processor; QoS; Microengine; Scheduling algorithm; Bit vector