A new routing algorithm for symmetric rearrangeable networks and emerging applications

Abstract

Routing algorithms for symmetric rearrange able networks have been an open issue from the time of their inception. Most of the studied algorithms are nonblocking and work for full active permutations. Nonblocking algorithms compromise time complexities to get high throughput from the network. Blocking algorithms have much lower time complexities than nonblocking algorithms but suffer from low throughput. This paper introduces a new routing algorithm for symmetric rearrangeable network class built with 2 2 switching elements. This new algorithm works for both full and partial permutations without any modifications to the method. An optimal routing algorithm is used in the outermost stages of the network and in the innermost stages the decision making is based on the state of the switching elements. This new algorithm is called as hybrid routing algorithm. The required execution time of this new algorithm is much faster than optimal algorithm, and it has better scaling properties than sub optimal routing algorithms. This paper also addresses some of the emerging applications built using symmetric rearrangeable network class.