Document Type
Conference Proceeding
Publisher
IEEE
Faculty
Faculty of Computing, Health and Science
School
School of Engineering / Centre for Communications Engineering Research
RAS ID
5357
Abstract
Path-arc integer linear programming (ILP) models for shared backup path protection (SBPP) in optical mesh networks generally contain many redundant constraints for calculating shared backup capacity. This greatly increases the computational time of the ILP solvers. In this paper, we first identify the sharing relationship between working and backup capacities, which facilitates the development of two novel algorithms for minimizing the number of constraints in ILP models for SBPP in mesh networks. Next, we consider the more realistic case of Shared Risk Link Group (SRLG) networks, where some optical fibers have the same risk of a physical cut due to being bundled in the same conduit. We propose a path-arc ILP model for SBPP in SRLG networks and minimize the number of constraints in this ILP model using the proposed algorithms. Simulation results show a remarkable reduction of around 50% in the number of constraints, which significantly improves the computational complexity of the model.
DOI
10.1109/ICON.2007.4444094
Access Rights
free_to_read
Comments
This is an Author's Accepted Manuscript of: Habibi, D., Phung, V., & Nguyen, H. N. (2007). Minimizing the Number of Constraints for Shared Backup Path Protection (SBPP) in Shared Risk Link Group (SRLG) Optical Mesh Networks. Proceedings of IEEE International Conference on Networks. (pp. 246-251). Adelaide. IEEE. Available here
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.