A heuristic search for dynamic lightpath establishment in WDM optical networks with limited wavelength conversion capability

This paper proposes an efficient dynamic wavelength assignment heuristic search technique for optical networks. The static wavelength assignment for optical network is known to be NP-hard problem in literature. This is true for dynamic wavelength assignment. Thus the problem can be formulated as combinatorial optimization problem. So to solve this problem an efficient heuristic search technique can be used. In the proposed study, we have assumed that all nodes of an optical network have a converter of limited wavelength conversion capability. In this work we used the best first search technique and tried to study the time requirement and call blocking probability for setting up a lightpath between a pair of nodes with optimum number of wavelength conversion.