This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalized Measures of Fault Tolerance in n-Cube Networks
June 1993 (vol. 4 no. 6)
pp. 702-703

It is shown that for a given p (math), the n-cube network can tolerate up to p2/sup(n-p)/-1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p=n-1,obtained by A.-M Esfahanian (1989). It is also shown that the n-cube network withn greater than or equal to 5 remains connected provided that at most two neighbors of any processor areallowed to fail.

[1] A.-H. Esfahanian, "Generalized measures of fault tolerance with application ton-cube networks,"IEEE Trans. Comput., vol. 38, no. 11, pp. 1586-1591, 1989.
[2] A. H. Esfahanian and S. L. Hakimi, "On computing a conditional edge-connectivity of a graph,"J. Inform. Processing Lett., vol. 27, pp. 195-199, Apr. 1988.
[3] S. Latifi, "Comments on: Generalized measures of fault tolerance with application to n-cube networks," preprint, Elec. and Comput. Eng. Dep., Univ. Nevada, Las Vegas, Jan. 1990.
[4] A. D. Oh, H.-A. Choi, and A.-H. Esfahanian, "Some results on generalized connectivity with applications to topological design of fault-tolerant multicomputers," Tech. Rep., GWU-IIST-91-08, Dep. Elec. Eng. and Comput. Sci., George Washington Univ.; presented at the Twenty Second Southeastern Int. Conf. Combinatorics, Graph Theory, and Comput., Louisiana State Univ., Feb. 11-15, 1991.

Index Terms:
Index Termsfault tolerance; n-cube network; processor failures; nonfaulty processor; fault tolerantcomputing; multiprocessor interconnection networks
Citation:
A.D. Oh, H.A. Choi, "Generalized Measures of Fault Tolerance in n-Cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 702-703, June 1993, doi:10.1109/71.242153
Usage of this product signifies your acceptance of the Terms of Use.