A heuristic algorithm in static routing and wavelength assigment [sic] assignment

Abstract

The exponential increasing demands of bandwidth in the optical network were solved by a new technology named wavelength division multiplexing (WDM). In WDM networks, many users can communicate at the same time by sharing the same physical link, when each connection is referred to as a lightpath. This technique faces a problem, which is, how to set up a lightpath by routing and how to assign a wavelength (channel, color) to each connection. This problem is called routing and wavelength assignment (RWA). A heuristic algorithm is considered in this project to solve a static routing problem. This algorithm solve the problem of routing by trying to find the good routes with minimum congestion, and solve the problem of wavelength assignment using graph coloring algorithm.