The complexity of the residual node connectedness reliability problem
SIAM Journal on Computing
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Simulation
| Hi-index | 14.98 |
The RVR (recursive variance reduction) simulation technique has been used with success for the evaluation of the terminal reliability measure of networks where only links can fail. In this paper, we show how this technique can be adapted for computing the terminal residual connectedness reliability measure in the case of networks where nodes can fail. We prove that RVR simulation of residual connectedness reliability has a lower variance than standard Monte Carlo simulation, leading to better estimates. We study the worst case computational complexity of the RVR method, and we discuss the influence of the nodes failure probability in the algorithm performance, which makes it more efficient and specially suited for very reliable networks.