Efficient p-Cycle Design by Heuristic p-Cycle Selection and Refinement for Servivable WDM Mesh Networks
IEEE Communication Society
Faculty of Computing, Health and Science
School of Engineering and Mathematics / Centre for Communications Engineering Research
Using p-Cycles to protect against single span failures in Wavelength-Division Multiplexing (WDM) networks has been widely studied. p-Cycle retains not only the speed of ring-like restoration, but also achieves the capacity efficiency over mesh networks. However, in selecting an optimal set of p-cycles to achieve the minimum spare capacity and fast computational time is an NP-hard problem. To address this issue, we propose a heuristic approach to iteratively select and refine a set of p-cycles, which contains two algorithms: the Heuristic p-Cycle Selection (HPS) algorithm, and the Refine Selected Cycles (RSC) algorithm. Our simulation results show that the proposed approach is within 3.5% redundancy difference from the optimal solution with very fast computation time even for large networks.
This is an Author's Accepted Manuscript of: Lo, K. , Habibi, D. , Phung, Q. , Rassau, A. M., & Nguyen, H. N. (2006). Efficient p-Cycle Design by Heuristic p-Cycle Selection and Refinement for Servivable WDM Mesh Networks. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM). (pp. 1-5). San Francisco, USA. IEEE Communication Society. Available here
© 2006 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.