In this paper we present the static manycast routing and wavelength assignment (MA-RWA) problem along with heuristics and an integer linear program (ILP) to solve it. Manycast is a point-to-multipoint communication paradigm with applications in e-Science, Grid, and cloud computing. A manycast request specifies a candidate set of destinations, of which a subset must be reached. To solve MA-RWA, a light-tree must be assigned to each manycast request in a static set such that the number of wavelengths required is minimized. We present two heuristics, the shortest path heuristic (SPT) and the lambda path heuristic (LPH), a tabu search meta-heuristic (TS), and an ILP formulation. We show that TS provides results close to the optimal solution (from the ILP) for small networks. We then show that TS provides a 10% improvement over LPH and a 30%–40% improvement over SPT for various realistic networks.
© 2010 Optical Society of AmericaFull Article | PDF Article
Tanvir Rahman, Georgios Ellinas, and Mohamed Ali
J. Opt. Commun. Netw. 1(2) A44-A55 (2009)
Taiming Feng, Lu Ruan, and Wensheng Zhang
J. Opt. Commun. Netw. 2(7) 389-399 (2010)
Arush Gadkar, Jeremy Plante, and Vinod M. Vokkarane
J. Opt. Commun. Netw. 4(8) 571-585 (2012)