2006 14th IEEE International Conference on Networks 2006
DOI: 10.1109/icon.2006.302637
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid p-Cycle Search Algorithm for Protection in WDM Mesh Networks

Abstract: 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 In… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2009
2009
2010
2010

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…To avoid the limitations of ILP method, in [13,14,7,15] were proposed several heuristic algorithms, considering the state-of-the-art proposed metric to evaluate and optimize the optimal selection of p-Cycles.…”
Section: Pre-configured Protection Cyclesmentioning
confidence: 99%
See 1 more Smart Citation
“…To avoid the limitations of ILP method, in [13,14,7,15] were proposed several heuristic algorithms, considering the state-of-the-art proposed metric to evaluate and optimize the optimal selection of p-Cycles.…”
Section: Pre-configured Protection Cyclesmentioning
confidence: 99%
“…CIDA maximizes the AE of selected cycles. Most heuristic algorithms only consider spare capacity (cost), AE and NR to optimize the p-cycle selection [14,7,15]. A GA was recently proposed getting better results compared to CIDA and giving the possibility to consider another evaluation metric (fitness).…”
Section: B Optimal Selection Of Cyclesmentioning
confidence: 99%
“…In both cases a "good" p-cycles are expected from the generation algorithm. The problem of generation cycle components is nontrivial and has been studied among others in [5,6,7,8,9,10].…”
Section: Generation Of P-cyclesmentioning
confidence: 99%
“…(iv) edge-digraph approach [68,113]. p-cycles can be constructed using either ILP algorithms [114,115] or heuristic algorithms [116,117]. One of the heuristic algorithms is to identify cyclic node-disjoint paths pair between two nodes [68].…”
Section: P-cycle Based Protection Approaches For Optical Unicast Trafficmentioning
confidence: 99%