TY - GEN
T1 - QoS guaranteed input queued scheduling algorithms with low delay
AU - Li, Jinhui
AU - Ansari, Nirwan
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0035786621&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035786621&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0035786621
SN - 0780367111
T3 - 2001 IEEE Workshop on High Performance Switching and Routing
SP - 412
EP - 414
BT - 2001 IEEE Workshop on High Performance Switching and Routing
T2 - 2001 IEEE Workshop on High Performance Switching and Routing
Y2 - 29 May 2001 through 31 May 2001
ER -