Tabu Search Meta-Heuristic for Static Manycast Routing and Wavelength Assignmem over Wavelength-Routed Optical WDM Networks

摘要

This paper presents a tabu search meta-heuristic to solve the static manycast routing and wavelength assignment problem (MA-RWA). The problem is to route a set of manycast requests over a wavelength-routed WDM network such that the number of wavelengths required is minimized. We present the details of a tabu search meta-heuristic for this problem and compare it to two other MA-RWA heuristics called lambda path heuristic (LPH) and shortest path tree (SPT) heuristic. The tabu search meta-heuristic shows a 10% improvement over LPH and a 30-40% improvement over SPT for various realistic networks.