By Topic

QoS guaranteed input queued scheduling algorithms with low delay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jinhui Li ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Ansari, N.

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

Published in:

High Performance Switching and Routing, 2001 IEEE Workshop on

Date of Conference: