Algoritmos para o problema de roteamento e atribuição de comprimento de onda em redes ópticas WDM

Abstract

For an optical network achieve maximum performance, it is necessary that it’s resources are spend properly, this work aims to explain one of the major problems in optical networks: the routing and attribution of wavelength (RWA). Many papers in literature address this problem by optimizing resources usage in a optical network WDM, such as wavelength and/or number of fiber cable in the network. Concerning connection requisitons, there are 3 kind of problems: static, adaptive and dinamic. In this paper we plan and implement many algorithms to solve the RWA problem static and adaptive, the main objective is to serve all network requisitions by the shortest path and attribute the minimum number of wavelength, making the network stable and optimized. The computational results show the performance of each method.