A nonbacktracking matrix decomposition algorithm for routing on Clos networks
J.D. Carpineli, A. Yavuz Oruç · IEEE Transactions on Communications · 1993
A number of matrix decomposition schemes have been previously reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. It is shown that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. A parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking is given.>