By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Wojciech Kabacinski ; Poznan University of Technology, Chair of Communication and Computer Networks, ul. Polanka 3, 64-980, Poland ; Janusz Kleban ; Marek Michalski ; Mariusz Zal
more authors

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.

Published in:

2009 International Conference on High Performance Switching and Routing

Date of Conference:

22-24 June 2009