A Full Characterization of Irrelevant Components in Diameter Constrained Reliability

In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is connected, called \emph{reliability}. Although the exact reliability computation belongs to the class of $\mathcal{NP}$-Hard problems, the literature offers three exact methods for exact reliability computation, to know, Sum of Disjoint Products (SDPs), Inclusion-Exclusion and Factorization. Inspired in delay-sensitive applications in telecommunications, H\'ector Cancela and Louis Petingi defined in 2001 the diameter-constrained reliability, where terminals are required to be connected by $d$ hops or less, being $d$ a positive integer, called diameter. Factorization theory in classical network reliability is a mature area. However, an extension to the diameter-constrained context requires at least the recognition of irrelevant links, and an extension of deletion-contraction formula. In this paper, we fully characterize the determination of irrelevant links. Diameter-constrained reliability invariants are presented, which, together with the recognition of irrelevant links, represent the building-blocks for a new factorization theory. The paper is closed with a discussion of trends for future work.

[1]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

[2]  Héctor Cancela,et al.  Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network , 2011, IEEE Transactions on Reliability.

[3]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[4]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[5]  Jürgen Falb,et al.  The Internet Protocol , 2005, The Industrial Information Technology Handbook.

[6]  H. Cancela,et al.  Diameter constrained network reliability :exact evaluation by factorization and bounds , 2001 .

[7]  Kishor S. Trivedi,et al.  A survey of efficient reliability computation using disjoint products approach , 1995, Networks.

[8]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[9]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[10]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[11]  Wei Guo,et al.  Sliding scheduled lightpath provisioning by mixed partition coloring in WDM optical networks , 2013, Opt. Switch. Netw..

[12]  Appajosyula Satyanarayana,et al.  A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..

[13]  R. K. Wood,et al.  Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" , 1996, SIAM J. Comput..

[14]  Ramesh Bhandari,et al.  Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  Héctor Cancela,et al.  Reliability of communication networks with delay constraints: computational complexity and complete topologies , 2004, Int. J. Math. Math. Sci..

[17]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[18]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[19]  Eduardo Alberto Canale,et al.  Irrelevant Components and Exact Computation of the Diameter Constrained Reliability , 2014, ArXiv.

[20]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[21]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[22]  Eduardo Alberto Canale,et al.  Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals , 2014, ArXiv.

[23]  LOUIS PETINGI.  Diameter-related properties of graphs and applications to network reliability theory , 2013 .