Diameter constrained reliability: Complexity and distinguished topologies

Author

Canale, Eduardo ; Cancela, Hector ; Robledo, Franco ; Romero, Pablo ; Sartor, P.

Author_Institution

Inst. de Mat. y Estadistica (IMERL), Univ. de la Republica, Montevideo, Uruguay

fYear

2014

fDate

17-19 Nov. 2014

Firstpage

84

Lastpage

90

Abstract

Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p₁, ..., p_m) ∈ [0, 1]^m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities q_i = 1 - p_i. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by R_K,G^d(p).

Keywords

computational complexity; graph theory; probability; random processes; reliability theory; DCR computation; DCR-subproblems; Monma graphs; NP-hard problems; bounded corank; bounded genus; computational complexity; diameter; diameter-constrained reliability; elementary operations; fixed input parameter; planar graphs; polynomial number; positive integer; random graph; robust network design; subgraph; subset; terminals; vector; Bipartite graph; Computational complexity; Peer-to-peer computing; Polynomials; Reliability; Scattering; Computational Complexity; Diameter-Constrained Reliability; Monma Graphs; Network Reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Reliable Networks Design and Modeling (RNDM), 2014 6th International Workshop on

Conference_Location

Barcelona

Print_ISBN

978-1-4799-7039-1

Type

conf

DOI

10.1109/RNDM.2014.7014935

Filename

7014935