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.