@inproceedings{f281bfa65e9f4226a688058a50b971d3,
title = "The iTFF scheduling algorithm for input-queued switches",
abstract = "In input-queued scheduling, iSLIP algorithm is a milestone 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 new scheduling algorithm called iTFF (iterative {"}Time to leave{"} and {"}Full or not{"} First), which has better performance than iSLIP 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 implemented in hardware to achieve high speed. In this paper, two implementation schemes of the algorithm are also presented.",
keywords = "Bursty traffic, Scheduling, iSLIP, iTFF",
author = "Peng Wang and Hongbo Fang and Depeng Jin and Lieguang Zeng and Fang Tao",
year = "2004",
language = "English",
isbn = "0780386477",
series = "2004 International Conference on Communications, Circuits and Systems",
pages = "692--697",
booktitle = "2004 International Conference on Communications, Circuits and Systems",
note = "2004 International Conference on Communications, Circuits and Systems ; Conference date: 27-06-2004 Through 29-06-2004",
}