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

Packet dispatching schemes supporting uniform and nonuniform traffic distribution patterns in MSM Clos-network switches

Authors

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

Year of publication

2010

Published in

Advances in Electronics and Telecommunications

Journal year: 2010 | Journal volume: vol. 1 | Journal number: no. 2

Article type

scientific article

Publication language

english

Keywords
EN
  • Clos-network
  • packet scheduling
  • packet switching
  • virtual output queuing
Abstract

EN In this paper new packet dispatching schemes for efficient support of the uniform as well as the nonuniform traffic distribution patterns in Memory-Space-Memory (MSM) Closnetwork switches are presented. Three such schemes, called Static Dispatching-First Choice (SD-FC), Static Dispatching-Optimal Choice (SD-OC) and Input Module (IM)-Output Module (OM) Matching (IOM), are proposed and evaluated. The algorithms are able to unload the overloaded input buffers employing a central arbiter. This effect is a desirable feature especially for effective support of the nonuniform traffic distribution patterns. We show via simulation that the proposed schemes deliver very good performance in terms of throughput, cell delay, and input buffers size under different traffic distribution patterns. The results obtained for the proposed algorithms are compared with the results obtained for selected request-grant-accept iterative packet dispatching schemes.

Pages (from - to)

35 - 41

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