Análise estatística de projeto de topologias virtuais para redes ópticas em anéis hierárquicos

Abstract

The Virtual Topology Design (VTD) problem in optical networks which consists of finding a good set of ligthpaths that minimizes, or maximizes, a given parameter. It is usually modeled as a mixed-integer linear programming problems and is well known as NP-Hard. However most of those methods present high computational cost. Therefore, since the problem was proposed in 1996, many research groups have tried to develop both new exacts and heuristics methods to find good solutions to the VTD problem. This work presents an empirical study of how difficult is to find a good solution of the VTD problem to hierarchical ring optical networks. In order to better analyze the results we have used basic statistic theory to describe the set of solutions in their distributions. We have analyzed networks with 9, 24, 36, 60 and 120 nodes and compared the results obtained whith the optimal soluction, whenever possible, otherwise with the lowerbound. the results show that the problem we have been dealing is not that hard as we thought it would be