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

Author

Charbonneau, Neal ; Vokkarane, Vinod M.

Author_Institution

Dept. of Comput. & Inf. Sci., Univ. of Massachusetts, Dartmouth, MA, USA

fYear

2010

fDate

23-27 May 2010

Firstpage

1

Lastpage

5

Abstract

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.

Keywords

graph theory; multicast communication; optical fibre networks; search problems; telecommunication network routing; wavelength assignment; wavelength division multiplexing; MA-RWA heuristics; lambda path heuristic; manycast request; shortest path tree heuristic; static manycast routing; tabu search meta-heuristic; wavelength assignment; wavelength-routed optical WDM network; Bandwidth; Cloud computing; Grid computing; IP networks; Optical fiber networks; Peer to peer computing; Unicast; WDM networks; Wavelength assignment; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (ICC), 2010 IEEE International Conference on

Conference_Location

Cape Town

ISSN

1550-3607

Print_ISBN

978-1-4244-6402-9

Type

conf

DOI

10.1109/ICC.2010.5502241

Filename

5502241