A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks

Abstract- A class of strictly nonblocking (SNB) networks � Æ � Ô � « can be constructed from vertical stacking of multiple planes of Banyan networks. Fast routing algorithms are needed for finding available connection paths in � Æ � Ô � « networks. In this paper, by modeling the switching routing problem in SNB networks as strong edge coloring problem, we propose a simple and fast parallel routing algorithm for routing connections in SNB � Æ � Ô � « networks. The proposed algorithm can route connections in SNB � Æ � Ô � « networks in Ç Ô Æ time using a completely connected multiprocessor system of Æ processing elements. Our algorithm can be translated into algorithms with an Ç Ð � Æ Ð � Ð � Æ slowdown factor for the class of Æ-processor hypercubic networks, whose structures are no more complex than a single plane of � Æ�Ô� « networks