基于优先权的iSLIP算法及其仿真试验

Prioritized iSLIP Algorithm and Simulation

iSLIP算法是用于解决高速路由器交换结构调度问题的一种经典调度算法。在高速路由器中提供完备的QOS是当前研究的热点。基于优先权的iSLIP算法从优先权的角度对分组加以区分,可以与QOS区分服务机制较好的结合,从而实现基于类的QOS保证。本文从仿真的角度验证了基于优先权的iSLIP算法可以较好的实现QOS保证。

The iSLIP algorithm is a classical scheduling algorithm which is used to solve the scheduling problem in switch fabric of high-speed routers. Many researchers focus on providing QOS guarantees in high-speed routers. Prioritized iSLIP algorithm classifies packets based on priorities of packets and provides class-based QOS guarantees. This paper makes some simulation researches and proves prioritized iSLIP algorithm can provide QOS guarantees to some better degree.