通用高速分组交换调度算法

在iSLIP算法的基础上,应用二部图匹配中对角线数据无竞争的数学原理,采用关联指针的处理方法,提出了一种基于虚拟输出排队(VOQ)缓冲模式下的高速交换调度算法——迭代的关联指针轮转(i-CPRR)算法。该算法简化了指针的轮转方式,降低了设计难度。仿真表明,该算法减少了调度过程中的迭代次数,提高了算法在高负载条件下的带宽利用率,从而降低了交换系统的数据延时和VOQ队列深度,在高速交换系统中具有广泛的应用价值。

High-Speed Packet Switching Scheduling Algorithm

On the basis of iSLIP (iterative slip) algorithm,a VOQ (virtual output queuing) based high speed switching scheduling algorithm,i-CPRR (iterative-correlatived pointer round-robin) algorithm is presented.In this algorithm,the math principle of uncontested diagonal data in bipartite graphs matching is utilized and the correlative pointer processing method is adopted.This algorithm simplifies the round-robin mode of the pointer and reduces the design difficulty.The simulation results show that the algorithm decreases the iterative times in the scheduling procedure,improves the bandwidth utilization under heavy load,reduces the time delay and the depth of VOQ queue in the switching system.It has wide application prospective in high speed switching systems.