2007 IEEE International Conference on Communications 2007
DOI: 10.1109/icc.2007.376
|View full text |Cite
|
Sign up to set email alerts
|

A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration

Abstract: The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle construction algorithms need to enumerate/pre-select candidate cycles before ILP (Integer Linear Program) can be applied. In this paper, we propose a new algorithm which is only based on ILP. When the required number of p-cycles is not too large, our ILP can generate optimal/suboptimal solutions in reasonable amount of running time.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…To avoid distinguishing head/tail from other nodes on the PXT, we formulate the pre-cross-connection based on flows as in (11)- (12). Constraint (11) says that, if there is a flow on (u, v)∈E and v is not the sink b, then (u, v) must be pre-crossconnected to another vector (v, w) at node v. Similarly, constraint (12) says that, if there is a flow on (u, v)∈E and u is not the source a, then (u, v) must be pre-cross-connected to another (t, u)∈E at node u.…”
Section: Ilp Formulation For Pxt Designmentioning
confidence: 99%
See 1 more Smart Citation
“…To avoid distinguishing head/tail from other nodes on the PXT, we formulate the pre-cross-connection based on flows as in (11)- (12). Constraint (11) says that, if there is a flow on (u, v)∈E and v is not the sink b, then (u, v) must be pre-crossconnected to another vector (v, w) at node v. Similarly, constraint (12) says that, if there is a flow on (u, v)∈E and u is not the source a, then (u, v) must be pre-cross-connected to another (t, u)∈E at node u.…”
Section: Ilp Formulation For Pxt Designmentioning
confidence: 99%
“…But such techniques will adversely affect the solution quality. Although some recently proposed ILPs [9][10][11][12] remove the need of candidate cycle enumeration from simple p-cycle design, they cannot be directly extended to nonsimple p-cycle design. Second, we cannot find an existing work comparing the inherent differences between simple and nonsimple p-cycles.…”
Section: Introductionmentioning
confidence: 99%
“…Several ILP algorithms have been proposed to find p-Cycles without enumeration in WDM networks [8], [9], [10], but they assume that the traffic demand matrix is known and do not consider an all-optical environment with physical layer impairments. In [2] we developed an ILP formulation that applies to all-optical networks and preconfigures the p-Cycles for any dynamic traffic, with the assumption that all users have the same survivability requirement.…”
Section: Introductionmentioning
confidence: 99%
“…In [8], [9], [10], the authors provide ILP formulations to find p-Cycles without enumerating the candidate p-Cycles, but it is assumed that the traffic demand matrix is known. None of the mentioned papers is in the context of all-optical networks with physical layer impairments.…”
Section: Introductionmentioning
confidence: 99%