A Fault-Tolerant Rearrangeable

requirement for any practical high-performance networks. In this paper, we analyze the fault tolerance capability of the three-stage rearrangeable Clos network. We first establish a fault model on losing-contact faults in the switches of the network. Then, under this model, we analyze the fault tolerance capability of the Clos network when multiple such faults present in switches in the input stage, middle stage, and/or output stage of the network. Our results show that the rearrangeable condition on the number of middle stage switches for a fault-free rearrangeable Clos network still holds in the presence of a substantial amount of faults, while a more expensive ~ ! ~ ! : ~

[1]  Frank K. Hwang,et al.  Control Algorithms for Rearrangeable Clos Networks , 1983, IEEE Trans. Commun..

[2]  Evan L. Goldstein,et al.  Optical crossconnects for high-capacity lightwave networks , 1999, J. High Speed Networks.

[3]  Yuanyuan Yang,et al.  Wide-Sense Nonblocking Clos Networks Under Packing Strategy , 1999, IEEE Trans. Computers.

[4]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[5]  Richard Cole,et al.  On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..

[6]  Hamed Nassar,et al.  Fault-tolerance for Switching Networks , 2001 .

[7]  Yuanyuan Yang,et al.  An Analytical Model on the Blocking Probability of a Fault-Tolerant Network , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Robert J. McMillen,et al.  Performance and fault tolerance improvements in the Inverse Augmented Data Manipulator network , 1982, ISCA 1982.

[9]  Frank Hwang,et al.  The Mathematical Theory of Nonblocking Switching Networks , 1998 .

[10]  Seung-Woo Seo,et al.  Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm , 1999, IEEE Trans. Parallel Distributed Syst..

[11]  Bruce M. Maggs,et al.  Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks , 1992, IEEE Trans. Computers.

[12]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[13]  Howard Jay Siegel,et al.  A survey and comparison of fault-tolerant multistage interconnection networks , 1994 .

[14]  John D. Carpinelli,et al.  Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions , 1997, Advances in Switching Networks.

[15]  Cauligi S. Raghavendra,et al.  Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice , 1994 .

[16]  Frank K. Hwang,et al.  A new decomposition algorithm for rearrangeable Clos interconnection networks , 1996, IEEE Trans. Commun..

[17]  J. Lacey.  Optical switching and its impact on optical networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[18]  Richard Cole,et al.  Edge-Coloring Bipartite Multigraphs in O(E logD) Time , 1999, Comb..

[19]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[20]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[21]  Duncan H. Lawrie,et al.  A Class of Redundant Path Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[22]  Chunming Qiao,et al.  Nonblocking WDM Multicast Switching Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[23]  Jehoshua Bruck,et al.  Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages , 2000, IEEE Trans. Computers.

[24]  Suresh Chalasani,et al.  Equivalence between SP2 high-performance switches and three-stage Clos networks , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.