Multiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm

Página do item simplificado
dc.creatorRenata da Encarnacao Onety
dc.date.accessioned2019-08-11T07:54:03Z
dc.date.accessioned2025-09-09T00:15:14Z
dc.date.available2019-08-11T07:54:03Z
dc.date.issued2013-09-02
dc.identifier.urihttps://hdl.handle.net/1843/BUBD-9HTKE7
dc.languagePortuguês
dc.publisherUniversidade Federal de Minas Gerais
dc.rightsAcesso Aberto
dc.subjectEngenharia elétrica
dc.subjectAlgoritmos genéticos
dc.subject.otherMultiobjective genetic algorithm
dc.subject.otherRouting
dc.subject.otherVariable encodinga
dc.titleMultiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm
dc.typeTese de doutorado
local.contributor.advisor-co1Roberto Tadei
local.contributor.advisor1Ricardo Hiroshi Caldeira Takahashi
local.contributor.referee1Eduardo Gontijo Carrano
local.contributor.referee1Elizabeth Fialho Wanner
local.contributor.referee1Guido Perboli
local.contributor.referee1Hani Camille Yehia
local.description.resumoThe demand for different levels of Quality of Service (QoS) in IP networks is growing, mainly to attend multimedia applications. However, not only indicators of quality have conflicting features, but also the problem of determining routes covered by more than two QoS constraints is NP-complete (Nondeterministic Polynomial Time Complete). This work proposes an algorithm to optimize multiple Quality of Service indices of Multi Protocol Label Switching (MPLS) IP networks. Such an approach aims at minimizing the network cost and the amount of simultaneous requests rejection, as well as performing load balancing among routes. The proposed algorithm, the Variable Neighborhood Multiobjective Genetic Algorithm (VN-MGA), is a Genetic Algorithm based on the Elitist Non-Dominated Sorted Genetic Algorithm (NSGA-II), with a particular feature that different parts of a solution are encoded differently, at Level 1 and Level 2. In order to improve results, both representations are needed. At Level 1, the first part of the solution is encoded by considering as decision variables the arrows that form the routes to be followed by each request (whilst the second part of the solution is kept constant), whereas at Level 2, the second part of the solution is encoded by considering the sequence of requests as decision variables, and first part is kept constant. Paretofronts obtained by VN-MGA dominate fronts obtained by fixed-neighborhood encoding schemes. Besides potential benefits of the proposed approach application to packet routing optimization in MPLS networks, this work raises the theoretical issue of the systematic application of variable encodings, which allow variable neighborhood searches, as operators inside general evolutionary computation algorithms.
local.publisher.initialsUFMG

Arquivos

Pacote original

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
thesis_2013renataonety.pdf
Tamanho:
1.79 MB
Formato:
Adobe Portable Document Format
Baixar

Coleções

Pós-Graduação em Engenharia Elétrica - Teses

Logo UFMG