2010
DOI: 10.1007/s11107-010-0301-z
|View full text |Cite
|
Sign up to set email alerts
|

Two-layer mesh network optimization based on inter-layer decomposition

Abstract: Presently, backbone data networks are converging toward a typical two-layer architecture of an IP/MPLS layer over an optical layer. In this paper, we study the problem of maximizing a utility function for an Internet service provider (ISP) of a two-layer mesh networks and propose an efficient decomposition method based on Lagrange relaxation. Differing from previous works on two-layer mesh networks, our proposed decomposition method decomposes an original two-layer mathematic optimization problem, respectively… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 14 publications
0
17
0
Order By: Relevance
“…In contrast, constraint (7) prevents the use of metro and virtual nodes for routing demands. Finally, constraint (8) guarantees that a route over the virtual topology is computed for each demand.…”
Section: Sd(d)mentioning
confidence: 99%
See 3 more Smart Citations
“…In contrast, constraint (7) prevents the use of metro and virtual nodes for routing demands. Finally, constraint (8) guarantees that a route over the virtual topology is computed for each demand.…”
Section: Sd(d)mentioning
confidence: 99%
“…The SIMULTANEO problem can be considered NP-hard since simpler multilayer network planning problems without survivability have been proved to be NP-hard (e.g., [8]). Regarding its size, Table II contains expressions to estimate the number of variables and constraints for the models presented above.…”
Section: Complexity Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…The CUVINET problem is NP-hard since simpler multilayer network problems have been proved to be NP-hard (e.g., [24]). Regarding problem size, the number of variables is O(|D|·|M|·|A| + |D|·|V| 2 + |V| 2 ·|P|·|K|) and the number of constraints is O(|D|·|M|·|A| + |V| 2 ·(|D|+|P|) + |L|·|S|).…”
Section: Constraints (8)-mentioning
confidence: 99%