1. Repositório Institucional da UFMG
  2. Trabalhos Acadêmicos
  3. Dissertações e Teses
  4. Pós-Graduação em Engenharia Elétrica
  5. Teses de Doutorado
Please use this identifier to cite or link to this item: http://hdl.handle.net/1843/BUBD-9HTKE7
Full metadata record
DC FieldValueLanguage
dc.contributor.advisor1Ricardo Hiroshi Caldeira Takahashipt_BR
dc.contributor.advisor-co1Roberto Tadeipt_BR
dc.contributor.referee1Eduardo Gontijo Carranopt_BR
dc.contributor.referee2Elizabeth Fialho Wannerpt_BR
dc.contributor.referee3Guido Perbolipt_BR
dc.contributor.referee4Hani Camille Yehiapt_BR
dc.creatorRenata da Encarnacao Onetypt_BR
dc.date.accessioned2019-08-11T07:54:03Z-
dc.date.available2019-08-11T07:54:03Z-
dc.date.issued2013-09-02pt_BR
dc.identifier.urihttp://hdl.handle.net/1843/BUBD-9HTKE7-
dc.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.pt_BR
dc.languagePortuguêspt_BR
dc.publisherUniversidade Federal de Minas Geraispt_BR
dc.publisher.initialsUFMGpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectMultiobjective genetic algorithmpt_BR
dc.subjectRoutingpt_BR
dc.subjectVariable encodingapt_BR
dc.subject.otherEngenharia elétricapt_BR
dc.subject.otherAlgoritmos genéticospt_BR
dc.titleMultiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithmpt_BR
dc.typeTese de Doutoradopt_BR
Appears in Collections:Teses de Doutorado

Files in This Item:
File Description SizeFormat 
thesis_2013renataonety.pdf1.83 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.