Topology and Routing Schemes for Fault-Tolerant Clos Network

In this paper, a new fault-tolerant Clos network is presented by adding extra switches and redirecting boxes in ordinary Clos network. The extra switches and redirecting boxes can improve the run time of the routing algorithm significantly when the Clos network displays few or no faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm employs a minimum distribution priority scheme handling Clos specification matrix column by column and completely achieves rearrangeable non-blocking routing. The fault-tolerant routing algorithm can reach a low time complexity O(N^3/2) even in the worst case. Thus, the presented fault-tolerant Clos network and its routing algorithm are readily applicable to more Reliable Clos network.