Document Type

Conference Proceeding

Publisher

IEEE Communication Society

Faculty

Computing, Health and Science

School

Engineering and Mathematics, Centre for Communications Engineering Research

RAS ID

4550

Comments

This conference paper was originally published as: 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. Original article available here

Abstract

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.

DOI

10.1109/GLOCOM.2006.429

Included in

Engineering Commons

 
COinS
 

Link to publisher version (DOI)

10.1109/GLOCOM.2006.429