A self-adaptive threshold based scheduling algorithm for input-queued switches
A self-adaptive threshold based scheduling algorithm for input-queued switches
复制标题
一种基于阈值的自适应输入排队交换机调度算法
DOI：
10.1109/hpsr.2006.1709741
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Zhigong Wang
中科院分区：
文献类型：
--
作者：
Yuan Sun;Qingsheng Hu;Jiangtao Han;Zhigong Wang
提出了一种基于自适应门限的输入队列交换机轮循调度算法。在SATRR中，当相应的虚拟输出队列（VOQ）中头单元的队列长度或等待时间超过阈值时，在一定单元时间内匹配的输入和输出将被两个自适应阈值锁定。对于一对锁定的输入和输出，它们将在随后的单元时间内直接匹配，直到解锁。特别是，通过同时使用队列长度阈值和等待时间阈值（每个单元时间更新），SATRR在性能和硬件复杂性之间进行了很好的权衡。仿真结果表明，在各种交通模式下，与其他典型调度算法相比，SATRR的延迟性能具有一定的竞争力
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