Avaliação de um algoritmo exato para um problema biobjetivo de roteamento de fluxos usando um emulador de redes

Abstract

A biojective integer programming problem for flow routing consists in a function that minimizes the amount of all the flows jumps, and other that minimize the network bottleneck. This scenario may be applied for data flow routing on wireless mesh networks or sensor networks. There are plenty of academic researches proposing exact solutions, however the evaluations are made under traditional graphs metrics, such as the cardinality of the nondominated solutions set, greatest bottleneck, and enlarging the amount of jumps. Also, some researches perform an evaluation under real network metrics, but using as solution heuristics that don’t guarantee exacts solutions. This research analyzes the use of an exact algorithm applied to real network scenarios. The exact algorithm evaluations are given through a network emulator named Mininet, which allows the analysis of flow rate and delay. Besides routing, Mininet also allows emulating real applications based on Internet transmition protocols (i.e., TCP or UDP).