We propose a class of distributed, online wavelength-assignment algorithms for optical networks that take reach constraints into account. Given a desired route, the goal of the assignment algorithm is to find a low-cost sequence of unoccupied wavelength channels along the route. The sequence must satisfy constraints that involve the availability of wavelength converters, regenerators, and reach limitations. The proposed class of algorithms use least-cost computations in auxiliary graphs. The graph structure enforces the constraints, while costs may be assigned to the graph to represent the cost of network resources. In particular, graph weights can be chosen to perform load-balancing of regenerator and fiber resources. Simulations of the algorithm in ring and mesh networks demonstrate the effectiveness of the load-balancing approach.
© 2003 Optical Society of America
Original Manuscript: May 6, 2003
Revised Manuscript: May 6, 2003
Published: August 1, 2003
Krishnan Kumaran, Carl Nuzman, and Indra Widjaja, "Wavelength assignment for partially transparent networks with reach constraints," J. Opt. Netw. 2, 285-302 (2003)