By Topic

Parallel iterative matching-based cell scheduling algorithm for high-performance 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
$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)
Young-Keun Park ; Dept. of Electr. & Electron. Eng., Yonsei Univ., Seoul, South Korea ; Young-Keun Lee

Many cell scheduling algorithms for input-buffered ATM switches have been proposed since head-of-line (HOL) blocking which limits the maximum throughput can be significantly reduced by proper cell scheduling. Even though various probabilistic iterative matching (PIM) algorithms have been presented to perform cell scheduling based on the reserved bandwidth, the throughput of each link is not stable, especially with bursty traffic. To improve the scheduling performance while guaranteeing the reserved bandwidth, we propose a probabilistic parallel iterative matching (PPIM) algorithm. The proposed PPIM allocates a weight to every cell transmission request and it makes the grant probability for each input proportional to the reserved bandwidth. The simulation results show that the proposed algorithm can provide more stable link-utilization and higher throughput than other cell scheduling algorithms

Published in:

IEEE Transactions on Consumer Electronics  (Volume:47 ,  Issue: 1 )