Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Optical Communications and Networking Year : 2011

Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks

Abstract

The construction of light-trees is one of the principal subproblems for all-optical multicast routing in sparse splitting wavelength division multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a multicast session. However, the computation of the cost-optimal multicast light-trees is NP-hard. In this paper, first we study the cost bounds of the light-trees built for a multicast session in unweighted WDM networks. Then, partially based on this result, the approximation ratios of some classical multicast light-tree computation algorithms, i.e., the reroute-to-source (R2S) and member-only (MO) algorithms, are derived in both unweighted and non-equally-weighted WDM networks. Moreover, integer linear programming formulations are introduced and carried out to search the optimal light-trees for multicast routing. The cost bounds and approximation ratios of the R2S and MO algorithms in some candidate WDM backbone networks are examined through simulations.
Fichier principal
Vignette du fichier
cost_bound_00738071.pdf (406.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00738071 , version 1 (16-04-2021)

Identifiers

Cite

Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao. Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks. Journal of Optical Communications and Networking, 2011, 3 (4), pp.323-334. ⟨10.1364/JOCN.3.000323⟩. ⟨lirmm-00738071⟩
240 View
37 Download

Altmetric

Share

Gmail Facebook X LinkedIn More