Evolutionary computation at work for the optimization of link state routing protocols

Abstract

This work explores the optimization of a real-valued parameter, assigned to each network node running the Distributed Exponentially-weighted Flow SpliTting (DEFT) routing protocol, in order to address changes on traffic conditions. This new proposal avoids the need to alter link weights and forwarding paths, by adjusting traffic splitting. In this context, we explore the use of Evolutionary Algorithms both in single and multi-objective optimization problems, to obtain solutions that minimize network's congestion. We thank the Portuguese FCT under the scope of the strategic funding of UID/BIO/04469/2013 unitand COMPETE 2020(POCI-01-0145-FEDER-006684) and BioTecNorte (NORTE-010145-FEDER-000004) funded by European Regional Development Fund (Norte2020-ProgramaOperacionalRegionaldoNorte). info:eu-repo/semantics/publishedVersion

Original document

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

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

• http://repositorium.sdum.uminho.pt/bitstream/1822/47974/1/document_46920_1.pdf

• http://dl.acm.org/ft_gateway.cfm?id=3076110&ftid=1893733&dwn=1,

http://dx.doi.org/10.1145/3067695.3076110 under the license http://www.acm.org/publications/policies/copyright_policy#Background

• https://dblp.uni-trier.de/db/conf/gecco/gecco2017c.html#PereiraSR17,

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

https://repositorium.sdum.uminho.pt/bitstream/1822/47974/1/document_46920_1.pdf,

https://dl.acm.org/citation.cfm?id=3076110,

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

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