Abstract

In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future

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 call

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.