DocumentCode :
3260099
Title :
Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch
Author :
Nan Hua ; Peng Wang ; Depeng Jin ; Lieguang Zeng ; Bin Liu ; Gang Feng
Author_Institution :
Tsinghua Univ., Beijing
fYear :
2007
fDate :
24-28 June 2007
Firstpage :
6305
Lastpage :
6310
Abstract :
In this paper, we propose a fair and simple high-performance scheduling algorithm for combined input-crosspoint-queued switches, which is called tracking fair quota allocation (TFQA). Our algorithm is based on low-cost round-Robin scheme, which prioritizes the ports lagging behind our fair quota allocation scheme. Simulation shows that our algorithm could maintain over 99% throughput and achieve relatively low mean delay under almost all typical test traffic patterns, outperforming all known algorithms with the same implementation complexity, especially under heavy load scenarios. Moreover, our algorithm could provide max-min fairness under inadmissible traffic, better than many other typical algorithms proposed before.
Keywords :
minimax techniques; queueing theory; scheduling; telecommunication traffic; combined input-crosspoint-queued switch; fair scheduling algorithm; low-cost round-Robin scheme; max-min fairness; tracking fair quota allocation; traffic patterns; Communication switching; Counting circuits; Delay; Fabrics; Job shop scheduling; Round robin; Scheduling algorithm; Switches; Throughput; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2007. ICC '07. IEEE International Conference on
Conference_Location :
Glasgow
Print_ISBN :
1-4244-0353-7
Type :
conf
DOI :
10.1109/ICC.2007.1044
Filename :
4289715
Link To Document :
بازگشت