Résumé: 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.

Langue: Anglais