An efficient sequential iterative matching algorithm for CIOQ switches

This paper presents a sequential mode that can be used to improve the efficiency of iterative matching algorithm for CIOQ crossbar switches. The proposed matching algorithm is collectively called SIM-δ, and four different configuration are presented: restricted iteration, pipelined iteration, exhaustive transmission, and GSI (general state information)-based matching arbitration. The implementation-based simulation results show that switches with SIM-δ outperform switches with other matching algorithms, such as iSLIP, under uniform Bernoulli and bursty, non-uniform local hotspot and diagonal traffic models. We also explore the impact of speedup to throughput and delay. For uniform Bernoulli traffic, without or with small speedup, SIM-δ can achieve higher aggregate throughput and lower average delay than iSLIP.