Skip to Main content Skip to Navigation

All-Optical Multicast Routing Algorithms without Splitters

Dinh Danh Le 1 Miklós Molnár 1 Jérôme Palaysi 1
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Multicasting in WDM core networks is an efficient way to economize network resources for several multimedia applications. Due to their complexity and cost, multicast capable switches are rare in the proposed architectures. In practical routing cases, the state of the network is given by a directed graph. The paper investigates the multicast routing without splitters in directed asymmetric topologies. The objective is to minimize the number of used wavelengths and if there are several solutions, choose the best cost one. We show that the optimal solution is a set of directed light-trails. The problem is NP-hard even in symmetric digraphs. An efficient heuristic is proposed to minimize the conflicts between the light-trails, and so to minimize the number of used wavelengths. The performance is compared to existing light-trail based heuristics and the four our algorithms provide a good solution with a few wavelengths required and a low cost.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Dinh Danh Le <>
Submitted on : Thursday, August 1, 2013 - 1:16:01 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Long-term archiving on: : Saturday, November 2, 2013 - 4:10:25 AM


Files produced by the author(s)


  • HAL Id : lirmm-00834276, version 2



Dinh Danh Le, Miklós Molnár, Jérôme Palaysi. All-Optical Multicast Routing Algorithms without Splitters. [Research Report] RR-13020, LIRMM. 2013, pp.23. ⟨lirmm-00834276v2⟩



Record views


Files downloads