Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Performance evaluation of the MSMPS algorithm under different distribution traffic

Authors

[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2013

Published in

Journal of Telecommunications and Information Technology

Journal year: 2013 | Journal number: no. 3

Article type

scientific article

Publication language

english

Keywords
EN
  • connection pattern
  • diagonally distributed traffic
  • lin-diagonally distributed traffic
  • MQL matrix
  • non-uniformly distributed traffic
  • switching fabric
Abstract

EN 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.

Pages (from - to)

74 - 79

URL

https://jtit.pl/jtit/article/view/1226/1213

Ministry points / journal

12

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.