Network reliability importance measures: combinatorics and Monte Carlo based computations

Authors:
Ilya Gertsbakh;Yoseph Shpungin
Affiliations:
Department of Mathematics, Ben Gurion University, Beer Sheva, Israel;Department of Software Engineering, Negev Academic College of Engineering and NMCRC, Beer Sheva, Israel
Venue:
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Year:
2007

Citing 2
Cited 1

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Combinatorial approaches to Monte Carlo estimation of network lifetime distribution: Research Articles

Applied Stochastic Models in Business and Industry - Reliability

A methodology of availability assessment for complex manufacturing systems

WSEAS TRANSACTIONS on SYSTEMS

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we focus on computational aspects of network reliability importance measure evaluation. It is a well known fact that most network reliability problems are NP-hard and therefore there is a significant gap between theoretical analysis and the ability to compute different reliability parameters for large or even moderate networks. In this paper we present two very efficient combinatorial Monte Carlo models for evaluating network reliability importance measures.