Abstract
Survivable routing serves as an important issue in core optical mesh networks. Operators are mainly interested in the protection of single link failures and a set of multiple link failures with high failure probability. In order to consider failure dependencies among links, Shared Risk Link Groups (SRLG) are defined in the network. Against a given set of SRLG failures the connection needs to be resilient to fulfill the required quality of service (QoS) level. Currently, 1+1 dedicated path protection is reported to be the most widely deployed network resilience mechanism because it offers instantaneous recovery from network failures. However, 1+1 protection in most cases unable to provide SRLG-disjoint paths, thus, it is not resilient against all SRLG failures under consideration. In this paper, a novel Bacterial Evolutionary Algorithm for the Integer (or non-bifurcated) Generalized Dedicated Protection (IGDP) is introduced to protect each SRLG in the operator's list. The proposed evolutionary algorithm aims to minimize the amount of reserved spare bandwidth. As a result, the solution is resilient against all failures in the SRLG list while the simplicity of 1+1 protection in signaling and switching is maintained. Extensive simulation is conducted to compare our evolutionary approach with previously reported optimal and heuristic solutions for the IGDP problem, by which its merits are further demonstrated.
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.
