Abstract
The shared risk link group (SRLG) has been widely recognized as a fundamental concept in layered network design by the industry. However, several issues related to SRLG protections that are of both theoretical interest and practical importance have not been explored fully. Two major issues are avoiding failures caused by traps in finding backup paths, and minimizing the total network capacity requested by active and backup paths. In this article, we highlight the significance of the trap problem in layered networks with SRLG and evaluate the performance of several existing SRLG protection schemes in terms of trap avoidance and bandwidth efficiency, as well as their complexities. We also demonstrate that a simple yet intelligent heuristic algorithm can achieve good performance.
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.