Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Photonic Network Communication Année : 2010

Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks

Résumé

In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N −1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917–1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage.
Fichier principal
Vignette du fichier
hypo-steiner.pdf (312.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00540937 , version 1 (29-11-2010)
hal-00540937 , version 2 (30-11-2010)

Identifiants

Citer

Fen Zhou, Miklós Molnár, Bernard Cousin. Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. Photonic Network Communication, 2010, 20 (1), pp.33-42. ⟨10.1007/s11107-010-0243-5⟩. ⟨hal-00540937v2⟩
188 Consultations
222 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More