Topological Properties of Hypercubes
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Graph Theory With Applications
Graph Theory With Applications
Methods for distributed unicast in hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Restricted arc-connectivity of digraphs
Information Processing Letters
A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
The restricted arc connectivity of Cartesian product digraphs
Information Processing Letters
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
| Hi-index | 14.98 |
In this paper, we study fault tolerance measures for m-ary n-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 m-ary n-dimensional hypercubes by requiring each node to have at least k 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 k is zero) tends to underestimate network resilience of large networks such as m-ary n-dimensional hypercubes.