Parallel routing algorithms for nonblocking electronic and photonic switching networks
We study the connection capacity of a class of rearrangeable nonblocking (RNB) and strictly nonblocking (SNB) networks with/without crosstalk-free constraint, model their routing problems as weak or strong edge-colorings of bipartite graphs, and propose efficient routing algorithms for these networks using parallel processing techniques. This class of networks includes networks constructed from Banyan networks by horizontal concatenation of extra stages and/or vertical stacking of multiple planes. We present a parallel algorithm that runs in O(lg(2) N) time for the RNB networks of complexities ranging from O(N lg N) to O(N-1.5 lg N) crosspoints and parallel algorithms that run in O(min{d* lg N, root N}) time for the SNB networks of O(N-1.5 lg N) crosspoints, using a completely connected multiprocessor system of N processing elements. Our algorithms can be translated into algorithms with an O(lg N lg lg N) slowdown factor for the class of N-processor hypercubic networks, whose structures are no more complex than a single plane in the RNB and SNB networks considered.
banyan network parallel algorithm crosstalk optical switching rearrangeable nonblocking network strictly nonblocking network switch control self-routing graph coloring