By Topic

Matrix-Based Nonblocking Routing Algorithm for Beneš Networks

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

3 Author(s)
Amitabha Chakrabarty ; Sch. of Electron. Eng., Dublin City Univ., Dublin, Ireland ; Martin Collier ; Sourav Mukhopadhyay

This paper presents a nonblocking routing algorithm for Benes networks. Such networks are of potential interest in implementing large scale optical cross-connects, but their complex routing algorithm limits their applications. We use a simple approach to determine the routing tags for a conflict free routing. Available methods proposed in the literature use computationally complex solutions to determine the routing tags.We propose a new approach for determining the paths through the network for all the requests coming to the inputs of the switch for unicast routing. Each switching stage has been represented by a set of sub-matrices and hence a conflict free routing is found.The correctness of the generated routing tags have been validated with mathematical method as well as with a simulator that can validate the correctness of the routing tags. This algorithm requires less complex practical implementation than the looping algorithm, making it viable for use in cross connect systems.

Published in:

Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009. COMPUTATIONWORLD '09. Computation World:

Date of Conference:

15-20 Nov. 2009