Adapting RVR simulation techniques for residual connectedness network reliability models

The RVR (recursive variance reduction) simulation technique has been used with success for the evaluation of the K-terminal reliability measure of networks where only links can fail. In this paper, we show how this technique can be adapted for computing the K-terminal residual connectedness reliability measure in the case of networks where nodes can fail. We prove that an RVR simulation of the 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 node failure probability on the algorithm performance, which makes it more efficient and especially suited for very reliable networks