Location of Repository

The tree cut and merge algorithm for estimation of network reliability

By K. Hui, N. Bean, M. Kraetzl and D. Kroese

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.K.P. Hui, N. Bean, M. Kraetzl and D. Kroes

Publisher: Cambridge Univ Press
Year: 2003
DOI identifier: 10.1017/S0269964803171021
OAI identifier: oai:digital.library.adelaide.edu.au:2440/610
Journal:

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.