Algorithm for Minimizing Network Cost in WDM Network

This paper is based on a novel heuristic algorithm for routing and wavelength assignment in virtual wavelength path routed WDM network. In this paper, we have considered a wavelength routed WDM optical network and the Heuristic algorithm is implemented on it. The term heuristics is used for algorithm, which finds solution among all possible ones, but they do not guarantee that the best solution will be found. Therefore they may be considered as approximate and not accurate algorithms. Heuristic algorithm has its own structure, so it never runs slowly and never gives very bad results. The results are always close to the best solution. In this paper the objective of this algorithm is to minimize the requirement of wavelength in any network topology demanded by network traffic. It also minimizes the hop length between source and destination nodes in the traffic. As wavelength and number of hops get reduced, the cost of the network also gets reduced and the resource utilization is maximized.