The iTFF Scheduling Algorithm for Input-Queued Switches  

作　　者：WANG Peng YI Peng JIN Depeng ZENG Lieguang 

机构地区：[1]State Key Laboratory on Microwave ＆ Digital Communication, Depatment of Electronic Engineering, Tsinghua University, Beijing 100084, China [2]Information Engineering University, Zhengzhou 450002, China

出　　处：《Chinese Journal of Electronics》2005年第4期676-680,共5页电子学报（英文版）

摘　　要：In crossbar-based input-queued scheduling, i SLIP algorithm is well known for its high throughput and low implementation complexity. However under bursty arrivals, its average input latency increases dramatically and quite a few cells will be dropped as the input buffer overflows. Motivated by cutting down the cell loss rate without increasing the average input latency, we present a novel-scheduling algorithm called iTFF （iterative “Time to leave” and “Full or not” First）, which has better performance than i SLIP under bursty traffic conditions. Simulation results indicate that iTFF restrains the cell loss rate exponentially and yet maintains low average input latency. Moreover, iTFF can be proved to be stable for all admissible uniform i.i.d. Bernoulli traffic, and easily implemented in hardware to achieve high speed.

关 键 词：iSLIP iTFF （iterative “Time to leave”and “Full or not” First） Bursty traffic SCHEDULE 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]