Disjoint products and efficient computation of reliability
Operations Research
Multistage Interconnection Network Reliability
IEEE Transactions on Computers
New Bounds on the Reliability of Augmented Shuffle-Exchange Networks
IEEE Transactions on Computers
Network Reliability: Experiments with a Symbolic Algebra Environment
Network Reliability: Experiments with a Symbolic Algebra Environment
Assessing Reliability of Multistage Interconnection Networks
IEEE Transactions on Computers
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
Reliability of a Class of Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
An ROBDD-based combinatorial method for the evaluation of yield of defect-tolerant systems-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
This paper proposes a cut-based technique to compute bounds on the full access probability of an extra stage shuffle exchange network ($ESEN$) and a wrap-around inverse banyan network ($WIBN$). Note that the problem of finding an exact full access probability is known to be NP-hard. Our results obtain tighter bounds as compared to those using existing techniques. For a small size multistage interconnection network, it deviates less from the exact value. We also notice that our proposed lower bound is conservative. Further, the lower bound is important as it suggests that a network is at least this much reliable.