IEEE INFOCOM 2019 - IEEE Conference on Computer Communications 2019
DOI: 10.1109/infocom.2019.8737424
|View full text |Cite
|
Sign up to set email alerts
|

CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(33 citation statements)
references
References 19 publications
0
29
0
Order By: Relevance
“…At the time of this writing, the most advanced proposals for TE are based on refined optimization algorithms, such as Constraint Programming [7], Local Search [21], Mixed Integer Linear Programming [22] or Column Generation [23]. All these solutions offer significant performance improvements with respect to traditional routing strategies, such as shortest path routing or load balancing.…”
Section: Introductionmentioning
confidence: 99%
“…At the time of this writing, the most advanced proposals for TE are based on refined optimization algorithms, such as Constraint Programming [7], Local Search [21], Mixed Integer Linear Programming [22] or Column Generation [23]. All these solutions offer significant performance improvements with respect to traditional routing strategies, such as shortest path routing or load balancing.…”
Section: Introductionmentioning
confidence: 99%
“…For future work, the idea of using constraint separation could be investigated further, or other ideas of improving the runtime could be explored. Alternatively, using a completely different approach to more efficiently optimize SR paths, such as proposed in [17], could be looked into.…”
Section: Discussionmentioning
confidence: 99%
“…To quickly react to unexpected traffic changes and failures, Hartert et al proposed a new approach based on local search [18]. In [19], the authors proposed an algorithm based on column generation to solve the large-scale linear problems with guaranteeing the theory gap bound. In [16], the authors evaluated segment routing mechanism to do traffic engineering in real-world topologies and traffic demands.…”
Section: B Work Related To This Papermentioning
confidence: 99%