SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
IEEE Transactions on Computers
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Disjoint products and efficient computation of reliability
Operations Research
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Reliable computer systems (2nd ed.): design and evaluation
Reliable computer systems (2nd ed.): design and evaluation
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Advances in Distributed System Reliability
Advances in Distributed System Reliability
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
A Unified Task-Based Dependability Model for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Combinatorial Analysis of Subcube Reliability in Hypercubes
IEEE Transactions on Computers
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
Super p-restricted edge connectivity of line graphs
Information Sciences: an International Journal
Upper bounds on the connection probability for 2-D meshes and tori
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The hypercube topology, also known as the Boolean n-cube, has recently been used for multiprocessing systems. The paper considers two structural-reliability models, namely, terminal reliability (TR) and network reliability (NR), for the hypercube. Terminal (network) reliability is defined as the probability that there exists a working path connecting two (all) nodes. There are no known polynomial time algorithms for exact computation of TR or NR for the hypercube. Thus, lower-bound computation is a better alternative, because it is more efficient computationally, and the system will be at least as reliable as the bound. The paper presents algorithms to compute lower bounds on TR and NR for the hypercube considering node and/or link failures. These algorithms provide tighter bounds for both TR and NR than known results and run in time polynomial in the cube dimension n, specifically, within time O(n/sup 2/).