24 May 2021
09:00 Master's Defense Fully distance
Theme
Formulations and Heuristics for the Multicast Routing Problem with Quality of Service Restrictions for Ad hoc Vehicle Networks
Student
Carlos Victor Dantas Araújo
Advisor / Teacher
Advisor: Fábio Luiz Usberti / Co-supervisor: Cid Carvalho de Souza
Brief summary
This work addresses the problem of multicast routing with quality of service restrictions where, based on a graph representing a vehicle network, we want to send a message from a specific vehicle, root node, to a set of destination vehicles, terminal nodes , being able to use the other nodes of the network so that the forwarding is done. The use of all nodes is not mandatory and each connection has a cost of use and quality of service parameters. The values corresponding to these parameters will accumulate along the selected path for sending the message from the root to a terminal node and the sums thus obtained must respect limits established by the desired quality of service. The objective is to carry out the routing in order to maximize the number of terminal vehicles that receive messages in accordance with the quality of service. For that, formulations of whole and mixed programming are presented, together with a set of Lagrangian and heuristic relaxations. The implementations were subjected to computational experiments in instances that seek to resemble as much as possible with the real configurations.
Examination Board
Headlines:
| Fábio Luiz Usberti | IC / UNICAMP |
| Flávio Keidi Miyazawa | IC / UNICAMP |
| Mauricio Guilherme de Carvalho Resende | Amazon.com |
Substitutes:
| Guilherme Pimentel Telles | IC / UNICAMP |
| Luciana Salete Buriol | INF / UFRGS |