Eduardo Canale
ABSTRACT
In this paper we address a problem from the field of network reliability, called diameter-constrained reliability. Specifically, we are given a simple graph G = (V, E) with [V] = n nodes and [E] = m links, a subset K ⊆ V of terminals, a vector p = (p1,...,pm) ϵ [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 --- pi. 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 RdK,G(p).
The general DCR computation is inside the class of NP-Hard problems, since is subsumes the complexity that a random graph is connected. In this paper the computational complexity of DCR-subproblems is discussed in terms of the number of terminal nodes k = [K] and diameter d. A factorization formula for exact DCR computation is provided, that runs in exponential time in the worst case. Finally, a revision of graph-classes that accept DCR computation in polynomial time is then included. In this class we have graphs with bounded co-rank, graphs with bounded genus, planar graphs, and, in particular, Monma graphs, which are relevant in robust network design. We extend this class adding arborescence graphs. A discussion of trends for future work is offered in the conclusions.
- M. O. Ball. Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability, 35(3):230--239, aug. 1986.Google Scholar
- M. O. Ball and J. S. Provan. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Computing, 12:777--788, 1983.Google ScholarDigital Library
- N. Biggs. Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, 1993.Google Scholar
- F. T. Boesch, A. Satyanarayana, and C. L. Suffel. A survey of some network reliability analysis and synthesis results. Networks, 54(2):99--107, sep 2009. Google ScholarDigital Library
- J. Brown and C. Colbourn. Non-stanley bounds for network reliability. Journal of Algebraic Combinatorics, 5(1):13--36, 1996. Google ScholarDigital Library
- E. Canale, H. Cancela, F. Robledo, G. Rubino, and P. Sartor. On computing the 2-diameter-constrained K-reliability of networks. International Transactions in Operational Research, 20(1):49--58, 2013.Google ScholarCross Ref
- E. Canale, H. Cancela, F. Robledo, and P. Sartor. The complexity of computing the 2-k-reliability in networks. Information Processing Letters, 114(9):457--461, 2014.Google ScholarCross Ref
- E. Canale, P. Monzón, and F. Robledo. Global synchronization properties for different classes of underlying interconnection graphs for kuramoto coupled oscillators. In Future Generation Information Technology, volume 5899 of Lecture Notes in Computer Science, pages 104--111. Springer Berlin Heidelberg, 2009. Google ScholarDigital Library
- H. Cancela and M. E. Khadiri. The recursive variance-reduction simulation algorithm for network reliability evaluation. IEEE Transactions on Reliability, 52(2):207--212, 2003.Google Scholar
- H. Cancela and L. Petingi. Diameter constrained network reliability: exact evaluation by factorization and bounds. In ICIL'2001 (International Conference on Industrial Logistics), pages 359--366, 2001.Google Scholar
- H. Cancela and L. Petingi. Reliability of communication networks with delay constraints: computational complexity and complete topologies. International Journal of Mathematics and Mathematical Sciences, 2004:1551--1562, 2004.Google ScholarCross Ref
- C. J. Colbourn. Reliability issues in telecommunications network planning. In Telecommunications network planning, chapter 9, pages 135--146. Kluwer Academic Publishers, 1999.Google ScholarCross Ref
- S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, pages 151--158, New York, NY, USA, 1971. ACM. Google ScholarDigital Library
- G. S. Fishman. A Monte Carlo sampling plan for estimating network reliability. Operations Research, 34(4):581--594, july-august 1986. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, USA, 1979. Google ScholarDigital Library
- R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.Google ScholarCross Ref
- G. Kirchoff. Über die auflösung der gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer ströme geführt wird. Ann. Phys. Chem., 72:497--508, 1847.Google ScholarCross Ref
- D. P. Kroese, K.-P. Hui, and S. Nariai. Network reliability optimization via the cross-entropy method. IEEE Transactions on Reliability, 56(2):275--287, 2007.Google ScholarCross Ref
- C. Monma, B. Munson, and W. Pulleyblank. Minimum-weight two-connected spanning networks. Mathematical Programming, 46(1--3):153--171, 1990. Google ScholarDigital Library
- F. Moskowitz. The analysis of redundancy networks. AIEE Transactions on Communication Electronics, 39:627--632, 1958.Google Scholar
- F. Moskowitz. The analysis of redundancy networks. American Institute of Electrical Engineers, Part I: Communication and Electronics, Transactions of the, 77(5):627--632, 1958.Google Scholar
- S. J. Provan and M. O. Ball. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing, 12(4):777--788, 1983.Google ScholarDigital Library
- F. Robledo. GRASP heuristics for Wide Area Network design. PhD thesis, INRIA/IRISA, Université de Rennes I, Rennes, France, 2005.Google Scholar
- A. Rosenthal. Computing the reliability of complex networks. SIAM Journal on Applied Mathematics, 32(2):384--393, 1977.Google ScholarDigital Library
- P. Sartor. Propriétés et méthodes de calcul de la fiabilité diamètre-bornée des réseaux. PhD thesis, INRIA/IRISA, Université de Rennes I, Rennes, France, december 2013.Google Scholar
- L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410--421, 1979.Google ScholarDigital Library
Index Terms
- Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs
Recommendations
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
Let G=V,E be a simple graph with |V|=n vertices and |E|=m edges, a subset Kï V of terminals, a vector p=p1,',pm∈[0,1]m and a positive integer d, called the diameter. We assume vertices are perfect but edges fail stochastically and independently, with ...
Monte Carlo methods in diameter-constrained reliability
A classical requirement in the design of communication networks is that all entities must be connected. In a network where links may fail, the connectedness probability is called all-terminal reliability. The model is suitable for FTTH services, where ...
Factorization and exact evaluation of the source-terminal diameter-constrained reliability
In classical network reliability, the system under study is a network with perfect nodes and imperfect links that fail randomly and independently. The probability that a given subset K of terminal nodes belongs to the same connected component is called ...
Comments