Tighter Bounds on Full Access Probability in Fault-Tolerant Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Improved bounds for performability evaluation algorithms using state generation
Performance Evaluation
Measuring the network robustness by Monte Carlo estimation of shortest path length distribution
Mathematics and Computers in Simulation
The value of information in stochastic maximum flow problems
Computers and Operations Research
| Hi-index | 0.00 |
From the Publisher:This book examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It describes, in algorithmic outlines, techniques for reliability bounds and discusses implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are supported by sound theoretical development.