2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers 2009
DOI: 10.1109/acssc.2009.5470053
|View full text |Cite
|
Sign up to set email alerts
|

Minimization of label usage in (G)MPLS networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…However, following [8], the loop avoidance constraint of 3D*-LF (1f) is exchanged by inequalities (2a)-(2b) and equalities (2c) in order to allow in-path loops but avoid isolated cycles. Artificial flow z avk is initiated at each node v ∈ V \ {S, T } if x ak = 1 and a ∈ δ + (v).…”
Section: D*-lf: Minimizementioning
confidence: 99%
“…However, following [8], the loop avoidance constraint of 3D*-LF (1f) is exchanged by inequalities (2a)-(2b) and equalities (2c) in order to allow in-path loops but avoid isolated cycles. Artificial flow z avk is initiated at each node v ∈ V \ {S, T } if x ak = 1 and a ∈ δ + (v).…”
Section: D*-lf: Minimizementioning
confidence: 99%