A Full Characterization of Irrelevant Components in Diameter Constrained Reliability
Eduardo Canale, Pablo Romero, Gerardo Rubino

TL;DR
This paper fully characterizes irrelevant components in diameter-constrained network reliability, extending classical reliability methods to include diameter constraints and providing a foundation for new factorization techniques.
Contribution
It introduces a complete characterization of irrelevant links in diameter-constrained reliability, enabling the development of a new factorization theory for this context.
Findings
Characterization of irrelevant links in diameter-constrained reliability
Introduction of diameter-constrained reliability invariants
Foundation for a new factorization theory
Abstract
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 -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 hops or less, being a positive integer, called diameter. Factorization theory in classical network reliability is a mature area. However, an extension to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Graph Theory Research · Complexity and Algorithms in Graphs
