A routing algorithm for modified omega+omega interconnection networks

The rearrangeability of most omega-based 2log₂N-stage networks remains an open question, such as omega+omega networks. This paper utilizes a labeling scheme to define a class of 2log₂N-stage omega-based networks. An algorithm is proposed to solve the rearrangeability of this class of networks. This algorithm focuses on the the central stage connection labeling patterns instead of specific network topologies. Compared with the original looping algorithm, this algorithm can route some 2log₂N-stage omega-based networks in O(Nlog₂N) time