Abstract
Rearrange able switching networks have been a topic of interest for a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, cross points reduction etc. In this paper a new routing algorithm is presented for symmetricrearrangeable networks built with 22 switching element. Anew matrix based abstraction model is derived to determine conflict free routing paths for each input-output request. Each stage of a network is mapped into a set of sub-matrices and number of matrices in each stage correspond to number of subnetworks in that stage. Once the input permutation is given, matrix cells are populated with binary values depending on the position of the switching elements in the actual hardware and their mapped matrix cells. These binary values control the routing decision in the underlying hardware. This new routing algorithm is capable of connection setup for partial permutation, m = N, where N is the total input numbers and m is the number of active inputs. Overall the serial time complexity of this method is O(NlogN)1 and O(mlogN) where all N inputs are active and with m