Document Type
Conference Proceeding
Publisher
IEEE
Faculty
Faculty of Computing, Health and Science
School
School of Engineering and Mathematics / Centre for Communications Engineering Research
RAS ID
3556
Abstract
Survivable routing in wavelength division multiplexing (WDM) optical networks has been proven to be NP-hard problem. There is a trade-off between the computational time and the optimality of solutions in existing approaches to the problem. Existing heuristic approaches purely based the graph algorithms are efficient in computational time but do not offer optimal solutions and may fail in some cases even when a solution exists. Meanwhile, the integer linear programming (ILP) models offer optimal solutions but are intractable even with moderate scale networks. In this paper, we introduce a new algorithm for finding K pairs of disjoint paths which are employed as K candidate pairs for each connection in the ILP models. We introduce an ILP model for dedicated path protection in which the number of decision variables is mainly dependant on traffic requests and the constant K, not on the network size
DOI
10.1109/APCC.2005.1554044
Access Rights
free_to_read
Comments
This is an Author's Accepted Manuscript of: Phung, Q.V. , Habibi, D. , Nguyen, H. N., & Lo, K. (2005). K Pair of disjoint paths Algorithm for Protection in WDM Optical Networks. Proceedings of Asia Pacific Conference on Communications. (pp. 183-187). Perth. IEEE. Available here
© 2005 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.