Network Reliability Monte Carlo With Nodes Subject to Failure
Volume 10, Number 2, March 2014 - Paper 05 - pp. 163-172
ILYA GERTSBAKH1, YOSEPH SHPUNGIN2, R. VAISMAN31 Department of Mathematics, Ben-Gurion Universit, P. O. Box 653, Beer-Sheva, 84105, ISRAEL
2 Software Engineering Department, Sami Shamoon College of Engineering, Beer Sheva 84100 ISRAEL
3 Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa, ISRAEL
(Received on June 04, 2013, revised on November 15, 2013)
We extend the network reliability estimation methodology based on evolution (creation) Monte Carlo into four directions: (i) introducing unreliable nodes; (ii) adjusting the evolution process with merging to "closure" operation suitable for unreliable nodes; (iii) in case of numerical instability in computing convolutions, we suggest a special Monte Carlo algorithm based on importance sampling; (iv) we extend the traditional network terminal connectivity criterion to criteria describing network disintegration into a critical number of clusters, or the critical size of the largest component.
Click here to download the paper.
Please note : You will need Adobe Acrobat viewer to view the full articles.