The complexity of reliability computations in planar and acyclic graphs
SIAM Journal on Computing
On the permutation capability of multistage interconnection networks
IEEE Transactions on Computers
Multistage Interconnection Network Reliability
IEEE Transactions on Computers
Network reliability and algebraic structures
Network reliability and algebraic structures
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Tighter Bounds on Full Access Probability in Fault-Tolerant Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Analysis of a multistage interconnection network using binary decision diagrams (BDD)
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
| Hi-index | 14.98 |
Efficient methods for determining the lower and upper bounds on the probabilities of source-to-terminal communication in a multistage interconnection network are developed. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (renormalization) are presented; both can be computed in polynomial time. These strategies can be combined with existing methods based on coherence, and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. A second efficient upper bound (averaging) is developed. An empirical evaluation of the bounds is discussed. Finally, the value of these bounding strategies in assessing the reliability of interconnection networks is examined