Hierarchical round-robin matching for virtual output queuing switches

Baranowska, A.; Kabacinski, W.

doi:10.1109/aict.2005.46

Cited by 3 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Up today, several scheduling algorithms are presented in the literature [1]- [6]. It was compared and analyzed results for: iSLIP which was presented in [1], Maximal Matching with Round-Robin Selection (MMRRS) [2], [3], [4], Hierarchical Round-Robin Matching (HRRM) [5] and Parallel Iterative Matching (PIM) [6]. The efficiency is plotted in Figs.…”

Section: Simulation Results Analysismentioning

confidence: 99%

Performance Evaluation of the MSMPS Algorithm under Different Distribution Traffic

Danilewicz,

Dziuba

2013

JTIT

View full text Add to dashboard Cite

In this paper, the Maximal Size Matching with Permanent Selection (MSMPS) scheduling algorithm and its performance evaluation, under different traffic models, are described. In this article, computer simulation results under nonuniformly, diagonally and lin-diagonally distributed traffic models are presented. The simulations was performed for different switch sizes: 4×4, 8×8 and 16×16. Results for MSMPS algorithm and for other algorithms well known in the literature are discussed. All results are presented for 16×16 switch size but simulation results are representative for other switch sizes. Mean Time Delay and efficiency were compared and considered. It is shown that our algorithm achieve similar performance results like another algorithms, but it does not need any additional calculations. This information causes that MSMPS algorithm can be easily implemented in hardware.

show abstract