This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerance Analysis of One-Sided Crosspoint Switching Networks
February 1992 (vol. 41 no. 2)
pp. 143-158

The fault-tolerance capability of one-sided crosspoint networks is analyzed with respect to crosspoint faults. Because of the correspondence between one-sided crosspoint networks and multiple-bus interconnection networks, the analysis also applies to multiple-bus configurations, where M buses are used to interconnect N processors. Upper bounds are established on the size of a fault set to sustain a given level of connectivity. Two modes of operation are considered, namely, nonblocking and rearrangeable. A complete nonblocking switch matrix with N ports has N/sup 2//2 crosspoints. It is shown that at most N/2-1 faulty crosspoints can be tolerated in the case of nonblocking operation.

[1] C. J. Georgiou, "Fault-tolerant crosspoint switching networks," inProc. 14th Int. Symp. Fault-Tolerant Comput., July 1984, pp. 240-245.
[2] J. Ghosh and A. Varma, "Reduction of simultaneous-switching noise in large crossbar networks,"IEEE Trans. Circuits Syst., vol. 38, pp. 86-99, Jan. 1991.
[3] A. Varma, J. Ghosh, and C. J. Georgiou, "Rearrangeable operation of large crosspoint switching networks,"IEEE Trans. Commun., vol. COM-38, pp. 1616-1624, Sept. 1990.
[4] A. Varma and S. Chalasani, "Reduction of crosspoints in one-sided crosspoint switching networks," inProc. INFOCOM '89, Apr. 1989, pp. 943-952.
[5] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[6] V. E. Benes, "Blocking states in connecting networks made of square switches arranged in stages,"Bell Syst. Tech. J., vol. 60, no. 4, pp. 511-521, Apr. 1981.
[7] C. Mitchell and P. Wild, "One-stage one-sided rearrangeable switching networks,"IEEE Trans. Commun., vol. COM-37, pp. 52-56, Jan. 1989.
[8] T. Lang, M. Valero, and M. A. Fiol, "Reduction of connections for multibus organization,"IEEE Trans. Comput., vol. C-32, pp. 707-716, Aug. 1983.
[9] G. M. Masson, "Binomial switching networks for concentration and distribution,"IEEE Trans. Commun., vol. COM-25, pp. 873-884, 1977.
[10] S. Nakamura and G. M. Masson, "Lower bounds on crosspoints in concentrators,"IEEE Trans. Comput., vol. C-31, pp. 1173-1179, Dec. 1982.
[11] J. Szep and F. Forgo,Introduction to the Theory of Games, Reidel, 1985.
[12] J. E. Hopcroft and R. M. Karp, "Ann5/2algorithm for maximum matchings in bipartite graphs,"SIAM J. Comput., vol. 2, pp. 225-231, 1973.

Index Terms:
upper bounds; one-sided crosspoint switching networks; fault-tolerance; crosspoint faults; multiple-bus interconnection networks; multiple-bus configurations; fault set; connectivity; rearrangeable; nonblocking switch matrix; ports; fault tolerant computing; multiprocessor interconnection networks.
Citation:
A. Varma, S. Chalasani, "Fault-Tolerance Analysis of One-Sided Crosspoint Switching Networks," IEEE Transactions on Computers, vol. 41, no. 2, pp. 143-158, Feb. 1992, doi:10.1109/12.123392
Usage of this product signifies your acceptance of the Terms of Use.