Optimizing segment routing using evolutionary computation

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. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT Fundac¸˜ao para a Ciˆencia e Tecnologia within the Project Scope: UID/CEC/00319/2013. info:eu-repo/semantics/publishedVersion

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/1822/47099

• https://doi.org/10.1016/j.procs.2017.06.100 under the license cc-by-nc-nd

• https://api.elsevier.com/content/article/PII:S1877050917312784?httpAccept=text/xml,

https://api.elsevier.com/content/article/PII:S1877050917312784?httpAccept=text/plain,

http://dx.doi.org/10.1016/j.procs.2017.06.100 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://www.sciencedirect.com/science/article/pii/S1877050917312784,

https://repositorium.sdum.uminho.pt/bitstream/1822/47099/1/document_46853_1.pdf,

https://dblp.uni-trier.de/db/conf/fnc/fnc2017.html#PereiraRS17,

http://repositorium.sdum.uminho.pt/handle/1822/47099,

https://doi.org/10.1016/j.procs.2017.06.100,

https://core.ac.uk/display/132797274,

https://academic.microsoft.com/#/detail/2735761258