Abstract
Evaluating the reliability of weighted networks is an NP-hard problem. In this paper, a symbolic algorithm evaluating the reliability of network under capacity and delay constraints is proposed. First, the weighted network is converted to a symbolic algebraic decision diagrams (ADD) by encoding the vertices of the network, and the variable ordering are computed by breadth-first search and priority function in order to reduce the size of ADD. Then, edges in minimal paths (MPs) which does not meet the constraint formula of quickest path problem are not visited, leading to a low complexity of the network traversal. Finally, ADD constructed by two custom operators is traversed to compute the network reliability. The computational performance of the proposed algorithm is illustrated through some experimentation with different weighted networks.
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.
