By Topic

An enhanced iterative scheduling algorithm for ATM input-buffered switch

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)
Liew, S.Y. ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; Cheng, S.W. ; Lee, T.T.

This paper investigates an enhanced iterative scheduling called enhanced parallel iterative matching (EPIM) for input-buffered switches. EPIM is a modification of parallel iterative matching (PIM), and still maintains the original three-phase structure. Its capability for scheduling cell transmission is more than one time slot in each iteration which greatly increases the scheduling speed of the switch. Simulation shows that our algorithm outperforms PIM by a significant reduction in the number of iterations needed to approach the performance of the output queuing switch. Through incorporation with a static scheduling algorithm, EPIM can also operate in an environment containing a mix of cells belonging to both bandwidth-guaranteed and best-effort service categories

Published in:

ATM Workshop, 1999. IEEE Proceedings

Date of Conference:

1999