Abstract
A topological formula is derived for solving a variety of network reliability problems such as vertex-to-vertex communication from a source to a terminal; from a source to some specified subset of the vertices or else all vertices; between any given vertex-pair; between all vertex-pairs within a given subset of the vertices; or else between all vertex-pairs. The formula applies to networks consisting of imperfect (unreliable) vertices and/or links, and with failure events s-independent or not. The formula explicitly characterizes the structure of both cancelling and noncancelling terms in the reliability expression obtained by Inclusion-Exclusion, and involves only noncancelling terms. Earlier topological formulas for the source-to-terminal problem and the source-to-all-vertices problem are shown to be special cases of this new one.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
