On multicasting in wavelength-routing mesh networks

Hamad, A.M.; Wu, Tao; Kamal, Ahmed E.; Somani, Arun K.

doi:10.1016/j.comnet.2005.12.012

Cited by 32 publications

(46 citation statements)

References 77 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A LL-optical multicast routing (AOMR) [1] is to determine a set of lightpaths from a source to the multicast members of the same session in a WDM network. The light-tree concept is introduced in [2] to minimize the number of wavelength channels and transceivers for alloptical multicasting.…”

Section: Introductionmentioning

confidence: 99%

“…Although many light-tree computation heuristics have been proposed recently [7], [9]- [12], none of them has addressed the cost bound of multicast light-trees in sparse splitting WDM networks, let alone the approximation ratios 1 of the heuristic algorithms. Since the wavelength channel cost is a very important metric for the selection of the multicast light-trees, it is very critical to know at least the cost bound of the light-trees, which could be referenced when designing a WDM network.…”

Section: Introductionmentioning

confidence: 99%

“…An example sparse splitting WDM network count-cost is assumed over all the fiber links in the network. We prove that the total cost of a multicast session is upper bounded to (1) …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Zhou¹,

Molnar

Cousin

et al. 2011

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-The construction of light-trees is one of the principal subproblems for all-optical multicast routing (AOMR) 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 NPhard. In this paper, first we study the cost bounds of the lighttrees 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., Reroute-to-Source (R2S) and Member-Only (MO) algorithms are derived in both unweighted and nonequally weighted WDM networks. Moreover, integer linear programming (ILP) formulations are introduced and carried out to search the optimal light-trees for multicast routing. The cost bounds and approximation ratios of R2S and MO algorithms in some candidate WDM backbone networks are examined through simulations.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Zhou¹,

Molnar

Cousin

et al. 2011

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…We have recently surveyed all-optical multicasting over wavelength-routed WDM networks in [5], and recent comprehensive surveys on all-optical multicasting are given in [6] and [7]. Therefore, we only examine very recent papers in the field and stress the difference of our approach.…”

Section: Introductionmentioning

confidence: 99%

A Flexible Scalable Solution for All-Optical Multifiber Multicasting: SLAM

Köksal

Ersoy

2007

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-We previously proposed a mixed-integer linearprogramming formulation, solved by CPLEX, which is a stateof-the-art optimization tool, and two heuristic solutions, layered all-optical multicasting algorithm (LAMA) and conservative fiber and wavelength assignment (C-FWA), for all-optical multicasting in wavelength-routed multifiber wavelength-division multiplexed networks with sparse wavelength conversion and light-splitting restrictions. However, LAMA was not suitable for large and dynamic multicasting problems. In this paper, we evaluate and propose scalable layered all-optical multicasting (SLAM), which is a scalable version of LAMA, for any size static or dynamic multicasting problems. We demonstrate that SLAM performs very close to the optimal (the lower bound/CPLEX) and LAMA, and significantly better than the existing work and C-FWA in terms of nearly all metrics, including the session-and groupblocking probabilities (SBPs and GBPs), since it does not separate routing and fiber-wavelength assignment steps as compared to the other candidates like the existing work and C-FWA. Additionally, transmitter-optimized SLAM, which is a version of SLAM that is specifically tuned to minimize the number of transmitters used, spends three times less extra transmitters than SLAM, without a performance loss in other metrics (one extra transmitter for 12 multicast sessions). Therefore, the adjustable parameters of SLAM make it very flexible to balance different objectives.Index Terms-All-optic, multicast, multifiber, optic, sparse light splitting, sparse wavelength conversion, wavelength division multiplexing.

show abstract

“…Assume the given delay bound is  , each multicast tree must satisfy the following delay constraint 4 :…”

Section: A Constraintsmentioning

confidence: 99%

Constructing Resource Constrained Multicast Trees on WDM Networks with Limited Light-Splitting

Yang¹,

Liu²,

Huang³

2015

IJFCC

View full text Add to dashboard Cite

Abstract-Traditionally, the optimization goal of multicast routing in WDM optical networks is to minimize the number of wavelengths and fibers used for the multicasting. In this paper, we consider a problem concerned about how to multicast several video streams simultaneously to a number of clients in a given WDM network with sparse light spitting, where the number of wavelengths on each link is given in advance. Our goal is to construct a number of multicast trees for all required streams so that the multiple constraints: bandwidth, delay and multicast capability, are satisfied and the total number of clients participating in all multicast sessions is also maximized. This problem is referred as profit-oriented and delay-constrained group multicast routing ( ) problem. Two heuristic algorithms are proposed in this paper for this NP-hard problem. A set of experimental results are also provided to compare the performances of our heuristics with previous methods published in literature.

show abstract

On multicasting in wavelength-routing mesh networks

Cited by 32 publications

References 77 publications

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

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

A Flexible Scalable Solution for All-Optical Multifiber Multicasting: SLAM

Constructing Resource Constrained Multicast Trees on WDM Networks with Limited Light-Splitting

Contact Info

Product

Resources

About