A self-adaptive threshold based scheduling algorithm for input-queued switches
Yuan Sun, Qingsheng Hu, Jiangtao Han, Zhigong Wang · 2006
This paper presents a self-adaptive threshold based round-robin scheduling algorithm SATRR for input-queued switches. In SATRR, the matched input and output in certain cell time will be locked by two self-adaptive thresholds, whenever the queue length or the wait-time of the head cell in corresponding virtual output queue (VOQ) exceeds the thresholds. For a pair of locked input and output, they will be matched directly during succeeding cell times until unlocked. Particularly, by simultaneously employing the queue length threshold and the wait-time threshold which are updated every cell time, SATRR archives a good tradeoff between performance and hardware complexity. Simulation results indicate that the delay performance of SATRR is competitive when compared to other typical scheduling algorithms under various traffic patterns