A simulation method for network performability estimation using heuristically computed pathsets and cutsets Online publication date: Sat, 12-Jul-2014
by Franco Robledo; Pablo Sartor
International Journal of Metaheuristics (IJMHEUR), Vol. 2, No. 4, 2013
Abstract: Consider a set of terminal nodes K that belong to a network whose nodes are connected by links that fail independently with known probabilities. We introduce a method for estimating a performability measure that depends on the hop distance between terminal nodes. The new measure generalises the diameter-constrained network reliability measure. We propose a Monte Carlo method with significant variance reduction compared to crude Monte Carlo. It is based on using edge sets named d-pathsets and d-cutsets for reducing the variance of the estimator. These edge sets, considered as a priori known in previous literature, heavily affect the attained performance; we hereby introduce and compare a family of heuristics for their selection. Numerical examples are presented, showing the significant efficiency improvements that can be obtained by chaining the edge set selection heuristics to the proposed Monte Carlo sampling plan.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook