| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4960827 | Procedia Computer Science | 2017 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
VÃtor Pereira, Miguel Rocha, Pedro Sousa,