Document Type
Conference Proceeding
Publisher
IEEE
Faculty
Computing, Health and Science
School
Engineering and Mathematics, Centre for Communications Engineering Research
RAS ID
4622
Abstract
Shared link and shared path protections have been recognized as preferred schemes to protect traffic flows against network failures. In recent years, another method referred to as Shared Segment Protection has been studied as an alternative solution for protection. This method is more flexible and efficient in terms of capacity utilization and restoration time. However, to our best knowledge, this method has mostly been studied in dynamic provisioning scenarios in which searching for restoration paths is dynamically performed after a failure has occurred. In this paper, based on the path segmentation idea, we propose a method to generate good candidate routes for traffic demands in static provisioning. These candidates are used as input parameters of an Integer Linear Programming (ILP) model for shared backup protection. Numerical results show that the capacity efficiency resulting from these candidates is much better than the best known Shared Backup Path Protection (SBPP) schemes. In addition, although the restoration time of our scheme is a little bit longer than those implementing link protection, it is still faster than path protection schemes.
Comments
This conference paper was originally published as: Phung, Q., Habibi, D., Nguyen, H. N., & Lo, K. (2006). A segmentation method for shared protection in WDM networks. Proceedings of IEEE International Conference on Networks . (pp. 484-489). Singapore. IEEE. Original article available here