Decomposing graph with 2-node cuts for diameter constrained network reliability calculation

Authors:
Denis A. Migov;Alexey S. Rodionov
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia;Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia
Venue:
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Year:
2013

Citing 4
Cited 0

A decomposition algorithm for network reliability evaluation

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
On the characterization of the domination of a diameter-constrained network reliability model

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Computing diameter constrained reliability of a network with junction points

Automation and Remote Control
Network probabilistic connectivity: using node cuts

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network with unreliable communication channels and perfectly reliable nodes. The diameter constrained reliability for such a network is defined as a probability that a set of terminals of a network are linked by operational paths with number of included edges less or equal to given integer. The problem of computing this characteristic is known to be NP-hard, just like the problem of computing the probability of a network connectivity. We propose a new method that allows using node cuts to compute the reliability of a two-terminal network with diameter constraints, which makes the computations faster.