The tree cut and merge algorithm for estimation of network reliability

Hui, KP, Bean, N, Kraetzl, M and Kroese, D (2003) The tree cut and merge algorithm for estimation of network reliability. Probability In The Engineering And Informational Sciences, 17 1: 23-45. doi:10.1017/S0269964803171021


Author Hui, KP
Bean, N
Kraetzl, M
Kroese, D
Title The tree cut and merge algorithm for estimation of network reliability
Journal name Probability In The Engineering And Informational Sciences   Check publisher's open access policy
ISSN 0269-9648
Publication date 2003-01-01
Sub-type Article (original research)
DOI 10.1017/S0269964803171021
Volume 17
Issue 1
Start page 23
End page 45
Total pages 23
Editor S.M. Moss
Place of publication United Kingdom
Publisher Cambridge Journals
Collection year 2003
Language eng
Subject 230202 Stochastic Analysis and Modelling
780101 Mathematical sciences
CX
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.
Keyword Operations Research & Management Science
Statistics & Probability
Engineering, Industrial
Monte-carlo
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collections: Excellence in Research Australia (ERA) - Collection
School of Physical Sciences Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 7 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 17 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 05:33:20 EST