Multiple-threshold based scheduling algorithm for high performance input queued switches

Input queued switching architectures has become attractive for implementing high performance switches. Some maximal matching algorithms, e.g. PIM, iSLIP, are easily implemented in hardware, hence attract more attention in designing of the practical router. However, they usually need multiple iterations to achieve satisfying performance. In this paper, we propose a multiple-threshold based round robin matching algorithm (MTRRM) for high performance input queued crossbar switch scheduling. In MTRRM, when an input and an output are matched, the matching might be kept for more than one time slot. Simulation results show that our scheme can strongly reduce the average cell delay and increase the throughput under non-uniform traffic. MTRRM achieves quite good performance with single iteration and this promises us that it is more suitable for switch with high line rate or large number of ports.