Banca de QUALIFICAÇÃO: ROMERITO CAMPOS DE ANDRADE

Uma banca de QUALIFICAÇÃO de DOUTORADO foi cadastrada pelo programa.
DISCENTE : ROMERITO CAMPOS DE ANDRADE
DATA : 20/03/2017
HORA: 09:00
LOCAL: Auditório do CCET
TÍTULO:

Multicasting Routing in Multisession, Multi-Source and Multi-objective with Quality of Service: Models and Algorithms.


PALAVRAS-CHAVES:

Multicasting Routing, Multisession, Multi-Source, Multi-objective


PÁGINAS: 113
GRANDE ÁREA: Ciências Exatas e da Terra
ÁREA: Ciência da Computação
SUBÁREA: Teoria da Computação
ESPECIALIDADE: Análise de Algoritmos e Complexidade de Computação
RESUMO:

In the present work, it is proposed Thesis proposal about the modelling and optimization of the multicast routing problem considering a new approach with multiple groups and multiple sources per group in a multi-objective viewpoint. Two mathematical model are proposed. The first model aims to optimizing the residual capacity of the network subject to a budget limit. This limit establishes a maximum value available to build the solution. This model aims to incorporate the cost on the optimization process during the search process for solutions. The second proposed model is a multi-objective formulation the the problem considering three objective functions that aim at the maximization of the residual capacity of the network, minimizing the solution cost and minimizing the
length of the paths between the source vertex and the multicast group members. Both models are characterized as approaches that aim to all an important gap in the study of the problem, since there is not any work in the literature dealing with the problem considering optimization of the cost and network resources simultaneously. In addition, a broad review of the multicast routing problem is presented considering the objective function and constraints applied to the problem regarding to quality of service. Several algorithm are also presented to apply to the problem in the version with budget limit: ant colony, GRASP, genetic algorithm and Iterated Local Search. An algorithmic study was performed using the model with budget limit, the results obtained by the algorithms were compared to the exact results obtained by a solver. Finally, another algorithm is proposed to solve the problem of optimizing the residual capacity with multiple groups and multiple sources. The computational results of this algorithm outperforms the most recent result in the literature in several aspects such as network size, number of multicast groups and number of participants of the group.
Keywords: Multicast. Multiobjective.


MEMBROS DA BANCA:
Interno - 1201268 - ELIZABETH FERREIRA GOUVEA
Interno - 1149561 - MARCO CESAR GOLDBARG
Externo ao Programa - 2859606 - SILVIA MARIA DINIZ MONTEIRO MAIA
Externo à Instituição - MATHEUS DA SILVA MENEZES - UFERSA
Notícia cadastrada em: 09/03/2017 08:03
SIGAA | Superintendência de Informática - | | Copyright © 2006-2020 - UFRN - sigaa26-producao.info.ufrn.br.sigaa26-producao