Wavelength Assignment for Partially Transparent Networks with Reach Constraints

In this work, we propose and study a class of wavelength assignment (WA) algorithms, based on shortest-path computation in auxiliary graphs, which are designed to meet these goals. The graph construction ensures that the wavelength assignment meets reach constraints, tunability constraints, and other limitations imposed by the network. By appropriate choice of edge weights, the algorithms can also perform load-balancing of network resources (regenerators and wavelengths).