Abstract
This paper investigates the problem of finding two link-disjoint paths in mesh networks. Different from traditional studies, such as MIN-SUM, MIN-MAX, and MIN-MIN, the objective in this paper is to minimize the end-to-end failure probability, or equivalently, maximize the survivability under multiple link failures. We refer to this problem as MAX-SURV. Solving MAX-SURV provides 100% protection against single failure while maximizing the survivability under multiple failures. We prove that this problem is NP-complete, and we propose a heuristic algorithm for finding a solution. The corresponding upper bound and lower bound for given networks are also found. The time efficiency of the algorithms is analyzed, and the performance of the algorithms is evaluated through simulation.
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.
