Matrix-based nonblocking routing algorithm for Beneš networks
Chakrabarty, Amitabha, Collier, Martin and Mukhopadhyay, Sourav
(2009)
Matrix-based nonblocking routing algorithm for Beneš networks.
In: Computation World 2009 - Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 15-20 November 2009, Athens, Greece.
ISBN 978-1-4244-5166-1
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.
2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.
.
Institute of Electrical and Electronics Engineers. ISBN 978-1-4244-5166-1