Dynamic routing and assignment of wavelength algorithms in multi-fiber wavelength division multiplexing networks

Two algorithms are proposed for the dynamic routing and assignment of wavelength problem in multi-fiber wavelength division multiplexing all-optical networks. By virtue of the layered graph, the routing and assignment of wavelength subproblems can be considered simultaneously. Simulation shows that layered-graph-based RAW algorithms perform better than the existing ones. Making use of the special structure of the layered graph, we propose a shortest path algorithm, whose complexity is lower than that of the standard shortest path algorithms