Title
Efficient P-Cycles Design By Heuristic P-Cycle Selection And Refinement For Survivable Wdm Mesh Networks
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.
Year
DOI
Venue
2006
10.1109/GLOCOM.2006.429
GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE
DocType
ISSN
Citations 
Conference
1930-529X
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Kungmeng Lo162.44
Daryoush Habibi28220.85
Quoc V. Phung301.01
alexander rassau4134.82
Hoang N. Nguyen531.90