Approximation Ratios of Multicast Light-trees in WDM Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Approximation Ratios of Multicast Light-trees in WDM Networks

Résumé

All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The cost optimal multicast light-tree is NP-hard to compute, especially when taking sparse splitting into account. Thus many heuristic algorithms have been proposed. In this paper, the approximation ratios of two classical heuristic AOMR algorithms for sparse splitting WDM network are studied. Let K be the number of destinations in a multicast session, it is proved that Reroute-to-Source (R2S) algorithm achieves a tight approximation ratio equal to K in the non-equally-weighted WDM network while Member-Only (MO) algorithm approaches the optimal solution with a ratio inferior to (K2 + 3K)/4 for any WDM network. It is also found that if the WDM network G is unweighted, both the approximation ratios of R2S and MO are no bigger than the diameter of the network Diam(G). Simulation results illustrate that both R2S and MO obtain good performances in candidate WDM backbone NSF network, which are far from the worst cases.
Fichier principal
Vignette du fichier
GlobeCom-2010.pdf (163.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00540601 , version 1 (28-11-2010)

Identifiants

  • HAL Id : hal-00540601 , version 1

Citer

Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao. Approximation Ratios of Multicast Light-trees in WDM Networks. IEEE Global Telecommunications Conference (GLOBECOM 2010), Dec 2010, Miami, United States. ⟨hal-00540601⟩
201 Consultations
142 Téléchargements

Partager

Gmail Facebook X LinkedIn More