Şengezer, NamıkKarasan, Ezhan2016-02-082016-02-082005http://hdl.handle.net/11693/27326Date of Conference: 7-9 February 2005Conference Name: Conference on Optical Network Design and Modeling, IEEE 2005Sparse wavelength conversion can increase the performance of all-optical wavelength division multiplexing (WDM) networks signi cantly by relaxing the wavelength continuity constraint. In this paper, we study the wavelength converter placement problem in multi- ber networks with static traf c demands. We present a tabu search based heuristic algorithm. The objective of the algorithm is to satisfy all the traf c demands with the minimum total cost of bers achieved in the full conversion case, by placing minimum number of wavelength converting nodes. We also implement a greedy algorithm and compare the performances of these converter placement algorithms with the optimum solutions on a sample network. The Tabu search based algorithm achieves the optimum solution in 72% of the test cases and it increases the average number of wavelength converting nodes by less than 10% with respect to the optimum solution. The effect of the utilized routing scheme on the generated solutions and the correlation between the converter node locations and the amount of traf c passing through the nodes are also investigated.EnglishGreedy algorithmsOptical networksWavelength convertersAlgorithmsConstraint theoryHeuristic methodsOptical communicationProblem solvingTelecommunication trafficWavelength division multiplexingTSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networksConference Paper10.1109/ONDM.2005.1427018