Network reliability importance measures: combinatorics and Monte Carlo based computations

Authors:
Ilya Gertsbakh;Yoseph Shpungin
Affiliations:
Department of Mathematics, Ben Gurion University, Israel;Department of Software Engineering, Negev Academic College of Engineering and NMCRC, Israel
Venue:
WSEAS Transactions on Computers
Year:
2008

Citing 6
Cited 2

Reliability: probabilistic models and statistical methods

Reliability: probabilistic models and statistical methods
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
OBDD-Based Evaluation of Reliability and Importance Measures for Multistate Systems Subject to Imperfect Fault Coverage

IEEE Transactions on Dependable and Secure Computing
Sensitivity analysis of network reliability using monte carlo

WSC '05 Proceedings of the 37th conference on Winter simulation
Joint structural importance in consecutive-k systems

ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7

Model of optimal paths design for GMPLS network and evaluation of solution

WSEAS TRANSACTIONS on SYSTEMS
Speeding up computation of the reliability polynomial coefficients for a random graph

Automation and Remote Control

Quantified Score

Hi-index	0.00

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.