By Topic

Analysis model of multiple input-queued switches with PIM scheduling algorithm

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

2 Author(s)
Hyoung-Il Lee ; Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., South Korea ; Seung-Woo Seo

In this letter, we propose a new analysis model of multiple input-queued switches that use the parallel iterative matching (PIM) scheduling algorithm under i.i.d Bernoulli traffic. Compared to the previous analysis models, our approach incurs very low computational complexity while maintaining good accuracy by employing a simple queueing model. Specifically, we model an input queue of the switch as a synchronous Geom/Geom/1/B queue with a service rate which is directly obtained from a PIM scheduling algorithm. We perform the simulation and verify the accuracy of our model.

Published in:

Communications Letters, IEEE  (Volume:5 ,  Issue: 7 )