Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles

Grover, W.D.; Doucette, John

doi:10.1109/leosst.2002.1027542

Cited by 93 publications

(73 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sufficient capacity for working routes is provided in constraint (5). The capacity constraints in (6) and (7) attempt to avoid the problem of undue traffic congestion on each fiber link.…”

Section: Network Protection Designmentioning

confidence: 99%

“…A predictor tool to examine the potential efficiency of a p-cycle for protecting the working capacity is necessary. One such tool is a priori efficiency [6] where I is a span in L, Xp,l is the protection potential related to span I (Xp,l = 1 when span I is an on-cycle span and Xp,l = 2 if span I is a straddling span), and cost1 is the cost of capacity on span 1. If the cost of each span I is set to a unit of hop, then the total cost of a cycle is the number of hops in it, and the case is referred to as the non-cost-weighted or logical a priori efficiency [7], which can be expressed as: AE(p) = 2 x Sst,p| + Sonp (1) on,p where Sst,p is the number of straddling spans, and Son,p is the number of on-cycle spans.…”

mentioning

confidence: 99%

See 1 more Smart Citation

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

Habibi

Rassan

et al. 2006

2006 14th IEEE International Conference on Networks

View full text Add to dashboard Cite

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.

show abstract

“…Sufficient capacity for working routes is provided in constraint (5). The capacity constraints in (6) and (7) attempt to avoid the problem of undue traffic congestion on each fiber link.…”

Section: Network Protection Designmentioning

confidence: 99%

mentioning

confidence: 99%

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

Habibi

Rassan

et al. 2006

2006 14th IEEE International Conference on Networks

View full text Add to dashboard Cite

show abstract

“…We extend the basic "joint model" [4], [5], [29] by constraints enforcing the required node-survivability. These constraints ensure the solution contains p-cycles that fully house the qualified paths.…”

Section: Design Of P-cycle Network For Enhanced Node Failure Restmentioning

confidence: 99%

“…The cycles can be computed by, e.g., a breadth first search algorithm. The cycle set can comprise all possible cycles in the network or a limited subset to decrease computation time (see, e.g., [29], [31]). An entry π e,k ∈ {0, 1} of matrix Π indicates if edge e ∈ E is element of cycle k. An entry φ e,k ∈ {0, 1, 2} of matrix Φ indicates how many working capacity units on edge e ∈ E are protectable by a p-cycle unit on cycle k ∈ C. These latter matrix entries correspond to the useful paths, as denoted in [1], i.e., the number of useful paths a p-cycle can offer for protection of the edge.…”

Section: Design Of P-cycle Network For Enhanced Node Failure Restmentioning

confidence: 99%

Automatic protection switching for p-cycles in WDM networks

Schupke

2005

Optical Switching and Networking

View full text Add to dashboard Cite

Abstractp-Cycle recovery relies on a protection switching protocol. We detail several issues for such a protocol taking the evolution from ring networks to p-cycles into account. In particular, we propose and evaluate a protocol enhancement to provide means for node failure protection. For the evaluation, we describe an integer linear program, which is applied to network design case studies, and formulate availability models for p-cycles. The case studies show that the protocol enhancement improves availability at marginal additional design cost.

show abstract

“…using shortest paths) the optimal set of p-cycles is calculated using available capacity [1], [2], [3], [4], [5]. In the second approach, the routing of the working paths and the p-cycles are computed simultaneously optimizing the total capacity [6], [7], [10]. Solving the joint optimization problem is more difficult because of the additional computation complexity.…”

Section: Introductionmentioning

confidence: 99%

Multi-criteria p-cycle network design

Drid¹,

Cousin²,

Lahoud³

et al. 2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

Abstract-The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and heuristic approaches), for solving the problem, find the set of p-cycles protecting the network through two steps: one step for generating candidate p-cycles and a second step for selecting the efficient ones. In this paper, we present a novel heuristic approach, which computes an efficient set of p-cycles protecting the network in one step. Our heuristic approach takes into consideration two different criteria: the redundancy and the number of p-cycles involved in the solution. Simulation study shows that our approach necessitates a lower redundancy and fewer p-cycles to protect the network compared to state-of-the-art approaches.

show abstract

Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles

Cited by 93 publications

References 7 publications

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

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

Automatic protection switching for p-cycles in WDM networks

Multi-criteria p-cycle network design

Contact Info

Product

Resources

About