This article presents Monte Carlo techniques for estimating
network reliability. For highly reliable networks, techniques
based on graph evolution models provide very good performance.
However, they are known to have significant simulation cost.
An existing hybrid scheme (based on partitioning the time space)
is available to speed up the simulations; however, there are
difficulties with optimizing the important parameter associated
with this scheme. To overcome these difficulties, a new hybrid
scheme (based on partitioning the edge set) is proposed in this
article. The proposed scheme shows orders of magnitude improvement
of performance over the existing techniques in certain classes
of network. It also provides reliability bounds with little
overhead.
Chip firing and all-terminal network reliability bounds