DocumentCode
3110183
Title
QoS guaranteed input queued scheduling algorithms with low delay
Author
Li, Jinhui ; Ansari, Nirwan
Author_Institution
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fYear
2001
fDate
2001
Firstpage
412
Lastpage
414
Abstract
The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm
Keywords
packet switching; quality of service; queueing theory; scheduling; Birkhoff-von Neumann decomposition; QoS; average cell delay; cell delay guarantees; guaranteed input queued scheduling algorithms; input queued switches; low delay; rate guarantees; wave front Birkhoff-von Neumann decomposition; Character generation; Delay; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Switching and Routing, 2001 IEEE Workshop on
Conference_Location
Dallas, TX
Print_ISBN
0-7803-6711-1
Type
conf
DOI
10.1109/HPSR.2001.923671
Filename
923671
Link To Document