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.

Chapter

Download BibTeX

Title

Rearranging algorithms for log2(N, 0, p) switching networks with even number of stages

Authors

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

Year of publication

2009

Chapter type

paper

Publication language

english

Abstract

EN In this paper we consider the rearrangeable multi-plane banyan-type switching fabrics, called also log2, (N, 0, p) switching networks, with even number of stages. For such networks different rearranging algorithms have been proposed for both: one-at-a-time and simultaneous connection models. In this paper we consider the one at-a-time connection model, where connections arrive to the system one-by-one, and in case of blocking rearrangements are realized. To our knowledge, known algorithms require several rearrangements, and the number of such rearrangements have not been considered in the literature. We propose the new rearranging algorithm for the multi-plane banyan-type switching fabric composed of even number of stages. This algorithm leads to success using only one rearrangement. We also introduce the modified version of this new algorithm, in which rearrangement of an existing connecting path can be realized without its interruption.

Pages (from - to)

[1] - [6]

DOI

10.1109/HPSR.2009.5307430

URL

https://ieeexplore.ieee.org/document/5307430

Book

2009 International Conference on High Performance Switching and Routing

Presented on

International Conference on High Performance Switching and Routing, HPSR 2009, 22-24.06.2009, Paris, France

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