2017
DOI: 10.1016/j.procs.2017.06.100
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Segment Routing using Evolutionary Computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…For this reason, while optimizing the routing according to the specific objective, it is important to take into account the impact that excessively complex routing solutions might have on the network performance. Further than the end to end delay, some of the reviewed works also take into account SR related overhead, both in terms of bandwidth wasted due to Link Bandwidth [90], [91], [92], [95], [96] [97], [98], [99], [100], [102] [103], [104], [105], [106], [107] [108], [109][110], [111] Rejected Requests [90], [99]…”
Section: B Traffic Engineeringmentioning
confidence: 99%
“…For this reason, while optimizing the routing according to the specific objective, it is important to take into account the impact that excessively complex routing solutions might have on the network performance. Further than the end to end delay, some of the reviewed works also take into account SR related overhead, both in terms of bandwidth wasted due to Link Bandwidth [90], [91], [92], [95], [96] [97], [98], [99], [100], [102] [103], [104], [105], [106], [107] [108], [109][110], [111] Rejected Requests [90], [99]…”
Section: B Traffic Engineeringmentioning
confidence: 99%
“…We devised a set of experiments to evaluate the optimization method considering distinct synthetic network topologies with links' capacity varying uniformly in the interval [1; 10] Gbits and whose characteristics are summarized in Table I. For each network we randomly generated a set M of 100 traffic matrices (TMs) which model heavy traffic requirements between each pair of source/destination nodes following the scheme presented in [5].…”
Section: A Full Deployment Of Hybrid Ip/sdn Nodesmentioning
confidence: 99%
“…Most of such routing optimization proposals assume Equal-cost multi-path routing (ECMP) behavior to distribute traffic among several equal-cost routes to a given destination. Nevertheless, other approaches also focus on the use of a single shortest path between a given network source and destination [17] or, based in the work present in [18], also tackle such TE problem assuming that non-shortest paths may also be used to improve load-balancing levels and achieve a better distribution of traffic within the network infrastructure [19]. In a global perspective, in [20] the authors presents an extensive study overviewing several TE optimization techniques and approaches that have been deployed for managing intradomain routing in networks operated with shortest path routing protocols.…”
Section: Introductionmentioning
confidence: 99%