Abstract
In this work, we study the NP-hard problem of finding the path of maximum reliability between two end nodes in mesh networks against simultaneous failures of multiple links. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. We propose a novel algorithm to find the optimal path with semi-polynomial running time and prove its correctness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.