Analysis of iSLIP scheduling algorithm for input-queuing switches
Mitko Valchev Gospodinov, Evgeniya Peneva Gospodinova · 2004
The paper presents one of the most up-to-date iSLIP (iterative round robin matching with slip) algorithms for configuration and scheduling input-queuing switch fabrics. The aim of the paper is research the performance of the algorithm regarding cell delay in the queues depending on the load for input-queuing switches with 4, 8, 16 and 32 ports. The advantage of the algorithm is achieving almost 100% throughput as result of de-synchronization of output arbiters playing important role in providing low latency.