By Topic

An efficient scheduling algorithm for input-queuing ATM switches

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
$31 $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

3 Author(s)
Bin Li ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong ; Hamdi, M. ; Xi-Ren Cao

We propose and evaluate a three-phase scheduling algorithm for input-queuing ATM switches, and we term it the WRRLA algorithm. The WRRLA algorithm is an improvement over the conventional weighted round robin (WRR) algorithm by simply combining it together with the look ahead (LA) technique. In a WRRLA scheduling operation, the WRR algorithm is first applied to schedule the time-sensitive traffic in order to guarantee their quality of service, and then the LA technique is applied to schedule the data traffic in order to increase the throughput of the ATM switches. Simulation results show that the WRRLA algorithm achieves good performance in a simple architecture, less scheduling computation, higher efficiency (throughput) and lower delay bounds. Moreover, the WRRLA compares favorably with other famous scheduling algorithms, such as parallel iterative matching (PIM) and WRR

Published in:

Broadband Switching Systems Proceedings, 1997. IEEE BSS '97., 1997 2nd IEEE International Workshop on

Date of Conference:

2-4 Dec 1997