Planejamento de topologia virtual com combinação de tráfegos em redes óticas multiplexadas por divisão de comprimento de onda

Abstract

In this work, the Traffic Grooming problem (TGP) in WDM optical networks is explored regardless of underlying physical topology. A new integer linear program (ILP) is presented and tested. A layered graph representation of the problem is also presented. It is used to reformulate the problem and to obtain a "simplified" ILP. Two distinct approaches - Lagrangian-based and polyhedral approaches - are used in order to solve the problem. Lagrangian relaxation is used to generate lower bounds for TGP and a study is conducted in order to obtain valid inequalities for the proposed ILP. Several methods based on the two approaches - Lagrangian-based and polyhedral approaches - are implemented and tested. Test results suggest that Lagrangian-based approaches (specially, a Lagrangian-based heuristic) seem to perform better than polyhedral ones. Moreover, two other distinct versions of TGP are discussed. The first one is a new version of TGP for a "dynamic-grooming" scenario and the second a version of TGP in WDM optical network in which only some nodes have traffic-grooming capability ("sparse-grooming" scenario). A preliminary investigation is conducted and results are presented.