Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/610
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | The tree cut and merge algorithm for estimation of network reliability |
Author: | Hui, K. Bean, N. Kraetzl, M. Kroese, D. |
Citation: | Probability in the Engineering and Informational Sciences, 2003; 17(1):23-45 |
Publisher: | Cambridge Univ Press |
Issue Date: | 2003 |
ISSN: | 0269-9648 1469-8951 |
Statement of Responsibility: | K.P. 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. |
Provenance: | Published online by Cambridge University Press 07 Jan 2003 |
Rights: | Copyright © 2003 Cambridge University Press |
DOI: | 10.1017/S0269964803171021 |
Published version: | http://www.journals.cambridge.org/action/displayAbstract?fromPage=online&aid=137287 |
Appears in Collections: | Applied Mathematics publications Aurora harvest Environment Institute publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Hui_610.pdf | Published version | 322.28 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.