Name
Abstract | ||
|---|---|---|
Segment Routing (SR) combines the simplicity of Link-State routing protocols with the flexibility of Multiprotocol Label Switching (MPLS). By decomposing forwarding paths into segments, identified by labels, SR improves Traffic Engineering (TE) and enables new solutions for the optimization of network resources utilization. This work proposes an Evolutionary Computation approach that enables Path Computation Element (PCE) or Software-defined Network (SDN) controllers to optimize label switching paths for congestion avoidance while using at the most three labels to configure each label switching path. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.procs.2017.06.100 | Procedia Computer Science |
Keywords | Field | DocType |
Segment Routing,Traffic Engineering,Link-State Routing,Evolutionary Computation | Equal-cost multi-path routing,Link-state routing protocol,Path computation element,Multiprotocol Label Switching,Computer science,Static routing,Computer network,Label switching,Routing table,Virtual routing and forwarding,Distributed computing | Conference |
Volume | ISSN | Citations |
110 | 1877-0509 | 1 |
PageRank | References | Authors |
0.40 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vitor Pereira | 1 | 9 | 4.78 |
| Miguel Rocha | 2 | 20 | 18.26 |
| Pedro Sousa | 3 | 174 | 25.25 |