Issue No. 08 - August (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.707589
<p><b>Abstract</b>—In this paper, we study fault tolerance measures for <it>m</it>-ary <it>n</it>-dimensional hypercubes based on the concept of forbidden faulty sets. In a forbidden faulty set, certain nodes cannot be faulty at the same time and this model can better reflect fault patterns in a real system than the existing ones. Specifically, we study the bounds of the minimum vertex cut set for <it>m</it>-ary <it>n</it>-dimensional hypercubes by requiring each node to have at least <it>k</it> healthy neighbors. Our result enhances and generalizes a result by Latifi et al. for binary hypercubes. Our study also shows that the corresponding result based on the traditional fault model (where <it>k</it> is zero) tends to underestimate network resilience of large networks such as <it>m</it>-ary <it>n</it>-dimensional hypercubes.</p>
Fault tolerance, forbidden faulty sets, hypercubes, minimum vertex cut.
G. Guo and J. Wu, "Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets," in IEEE Transactions on Computers, vol. 47, no. , pp. 888-893, 1998.