THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY

Authors:
K.-P. Hui;N. Bean;M. Kraetzl;D. Kroese
Affiliations:
Information Networks Division, DSTO, Edinburgh 5111, Australia, E-mail: Kin-ping.Hui@dsto.defence.gov.au;Department of Applied Mathematics, University of Adelaide, Adelaide 5005, Australia, E-mail: nbean@maths.adelaide.edu.au;ISR Division, DSTO, Edinburgh 5111, Australia, E-mail: Miro.Kraetzl@dsto.defence.gov.au;Department of Mathematics, University of Queensland, Brisbane 4072, Australia, E-mail: kroese@maths.uq.edu.au
Venue:
Probability in the Engineering and Informational Sciences
Year:
2003

Citing 3
Cited 1

A Monte Carlo sampling plan for estimating network reliability

Operations Research
Combinatorics of reliability Monte Carlo

Random Structures & Algorithms
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability

Designing an optimal network using the cross-entropy method

IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.