Abstract
Consider a communication network composed by sites that never fail and links between them that fail independently from each other. In any instant, every link (x,y) is operational or failed according to known probabilities p(xy) and 1−p(xy). Let d be any positive integer. Computing the probability that a fixed subset K of sites is connected with paths of length not higher than d (considering only non-failing links) is known as the d-DCKR (d-diameter constrained K-reliability) problem. Its general case is known to belong to the NP-hard complexity class; there are a number of particular cases whose complexity remains undetermined. In this paper we show that the computational complexity of the d-DCKR is linear in the number of sites of the network when d=2 and |K| is fixed (i.e. when |K| is not an input but a parameter of the problem).
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.
