Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Computing, Health and Science

School

Engineering and Mathematics, Centre for Communications Engineering Research

RAS ID

4549

Comments

This article was originally published as: Lo, K. , Habibi, D. , Rassau, A. M., Phung, Q. , Nguyen, H. N., & Kang, B. K. (2006). A Hybrid p-Cycle Search Algorithm for Protection in WDM Mesh Networks. Proceedings of IEEE International Conference on Networks. (pp. 262-267). Singapore. IEEE. Original article available here

Abstract

p-Cycle is a type of shared link protection for survivable wavelength-division multiplexing (WDM) mesh networks. p-Cycle not only retains ring-like restoration speeds, but also achieves capacity efficiency in mesh networks. However, finding the optimal set of p-cycles to protect all traffic demands within a reasonable response time is difficult. This is particularity true with dense meshes or large networks, because the number of candidates is huge. Generally, p-cycles are determined by using either Integer Linear Programming (ILP) or specifically designed heuristic algorithms. However, both methods need a set of efficient candidate cycles to tradeoff between the computational time and the optimality of solutions. For this reason, constructing an efficient set of candidate p-cycles is crucial and imperative. In this paper, we propose the Span-weighted Cycle Searching (SCS) algorithm to generate and select an adequate number of p-cycles to minimize the spare capacity, while achieving 100% restorability, within low computational complexity.

DOI

10.1109/ICON.2006.302637

Included in

Engineering Commons

 
COinS
 

Link to publisher version (DOI)

10.1109/ICON.2006.302637