On a dynamic wavelength assignment algorithm for wavelength routed all-optical networks

Dynamic wavelength assignment has been known to provide significant improvement of wavelength utilization in a wavelength routed all-optical network. This paper considers the dynamic wavelength assignment problem and presents a distributed algorithm to solve it. The presented algorithm shows a significant improvement over existing schemes [14, 15] by reducing the blocking probability often by an order of magnitude. The algorithm is based on the assumption of the availability of adequate processing power at the routers and lightpaths are constructed dynamically when two end-nodes need to communicate. The effectiveness of the algorithm is compared to the schemes in [14, 15] in terms of blocking probability and set-up time through simulations.