2020
DOI: 10.1016/j.comnet.2019.106992
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Lagrange Decomposition for multi-objective scalable TE in SDN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 25 publications
0
1
0
1
Order By: Relevance
“…In the experiment, we use two non-overlapping sets of samples: 600 samples taken every 30 min (fine-grained) and 600 samples taken every 2h (coarsegrained), so in this case r = 4. While the model can use all four aggregation levels in the data, we focus here on only two of them because the practical solutions proposed in the literature are focused on a time scale of about 1h Jaglarz et al (2020) and because we could substantially simplify our implementation for r being a power of two. The overall time span 2 0 1 9 -1 1 -0 5 2 0 1 9 -1 1 -0 7 2 0 1 9 -1 1 -0 9 2 0 1 9 -1 1 -1 1 2 0 1 9 -1 1 -1 3 2 0 1 9 -1 1 -1 (a) time series 1 1 -1 4 0 6 1 1 -1 4 1 2 1 1 -1 4 1 8 1 1 -1 5 0 0 1 1 -1 5 0 6 1 1 -1 5 1 2 1 1 -1 5 1 8 1 1 -1 6 0 0 1 1 -1 6 0 then covers around 62 days, from which the last 2 days are used only for forecast validation.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…In the experiment, we use two non-overlapping sets of samples: 600 samples taken every 30 min (fine-grained) and 600 samples taken every 2h (coarsegrained), so in this case r = 4. While the model can use all four aggregation levels in the data, we focus here on only two of them because the practical solutions proposed in the literature are focused on a time scale of about 1h Jaglarz et al (2020) and because we could substantially simplify our implementation for r being a power of two. The overall time span 2 0 1 9 -1 1 -0 5 2 0 1 9 -1 1 -0 7 2 0 1 9 -1 1 -0 9 2 0 1 9 -1 1 -1 1 2 0 1 9 -1 1 -1 3 2 0 1 9 -1 1 -1 (a) time series 1 1 -1 4 0 6 1 1 -1 4 1 2 1 1 -1 4 1 8 1 1 -1 5 0 0 1 1 -1 5 0 6 1 1 -1 5 1 2 1 1 -1 5 1 8 1 1 -1 6 0 0 1 1 -1 6 0 then covers around 62 days, from which the last 2 days are used only for forecast validation.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…Networks are made up of many nodes that have millions of streams of dynamic nature. Jaglarz et al (2020) have addressed this issue. A novel linear programming problem of energy awareness, multi-objective, complex and integer formulation is modeled and solved using the Lagrange decomposition algorithm.…”
Section: B) Lagrange and Benders Algorithms In Comparisonmentioning
confidence: 99%
“…Em [8], foi apresentada uma estratégia de roteamento baseada no SPEA2, com fim de otimizar a eficiência energética da rede considerando também as restrições de QoS. Em [11], foi proposto um método de otimização de múltiplos critérios com foco em escalabilidade, utilizando decomposição de Lagrange aprimorado por sequências ergódicas, onde soluções são derivadas com base em pesos atribuídos para os critérios.…”
Section: Trabalhos Relacionadosunclassified