Improvement and comparison of input queue iSLIP algorithm
Kai Yang · Journal of North China Electric Power University · 2009
In high speed routers switching fabric,input-queued scheduling algorithms have favorable performances.In order to improve the performances of the well-known algorithm iSLIP,iSLIP algorithm is improved basing on the differences of the length of virtual output queues(VOQ) or the waiting time of the queue first cells,putting forward the new algorithms called lp-iSLIP and op-iSLIP.The mean cell latency in the two improved algorithms is shortter compared with iSLIP algorithm,so their performances are better.Last we have compared iSLIP algorithm and pri-iSLIP algorithm,the simulation results show the performances of pri-iSLIP algorithm is better than iSLIP algorithm.