Multicast routing and wavelength assignment in multihop optical networks

Libeskind-Hadas, Ran; Melhem, Rami

doi:10.1109/tnet.2002.803907

Cited by 76 publications

(50 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there is no specific declaration, the simulation parameters are configured as follows: | V |=200 |M|=8 G=0. 4 and L=12.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…According to the different number of multicast connecting requests, the multicast wavelength assignment (MC-WA) problem can be divided into two categories: MC-WA for single multicast which was studied in [2][3][4][5] and MC-WA for multiple multicasts which was studied in [6][7][8]. But to our best knowledge, few studies have been done on the multicast wavelength assignment (MC-WA) problem to minimize both the total number of wavelength conversions of the multicast tree and the number of different wavelengths used.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks

Wang¹,

Wu²,

Zhou³

et al. 2009

IJCNS

View full text Add to dashboard Cite

In this paper, we propose a new multicast wavelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree. The whole procedure of NGWA algorithm is separated into two phases: the partial wavelength assignment phase and the complete wavelength assignment phase. It tries to minimize the total number of wavelength conversions of the multicast tree. Meanwhile, the number of different wavelengths used is minimized locally. Through illustrative example and simulation experiments, it is proved that the NGWA algorithm works well and achieves satisfactory performance in terms of the average number of wavelength conversions and the average blocking probability.

show abstract

“…If there is no specific declaration, the simulation parameters are configured as follows: | V |=200 |M|=8 G=0. 4 and L=12.…”

Section: Simulation Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks

Wang¹,

Wu²,

Zhou³

et al. 2009

IJCNS

View full text Add to dashboard Cite

show abstract

“…Jia et al [12] considered the routing congestion issue in a single hop (alloptical) network by proposing two heuristic algorithms for a multicast problem that aims to minimize the total cost of a multicast tree under the end-to-end delay constraint. Libeskind-Hadas and Melhem [13] investigated multicast communication in circuit-switched multihop networks by showing that it is polynomially solvable when the optimization objective is the wavelength assignment only, despite the fact that the general multicast problem is NP-hard. In addition, there have been several other studies for constructing constrained multicast trees in WDM networks.…”

Section: Related Workmentioning

confidence: 99%

Online multicasting in WDM networks with shared light splitter bank

Liu

Liang

2008

Photon Netw Commun

View full text Add to dashboard Cite

We study online multicasting in WDM networks with shared light splitter bank. Our objective is either to maximize the network throughput or to minimize the blocking probability. Due to the nature of dynamic requesting for network resources by online multicast requests, the network usually is unable to allocate the resources needed for each request in advance. Instead, it either accepts the request by building an economic multicast tree for the request, in terms of the utilization of the network resources if it has sufficient resources available, or rejects the request, otherwise. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. Since optical light splitting and wavelength conversion switching in optical networks is cost expensive and its fabrication is difficult, it is assumed that only a limited number of light splitters and wavelength converters are installed at a node, which will be shared by all the incoming signals at the node. In addition, it is further assumed that only a fraction of nodes in the network are installed with such optical switches. In this article we first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modeling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.

show abstract

“…Sahin and Azizolgu [6] considered the multicast problem under various fanout policies. Libeskind-Hadas and Melhem [7] investigated multicast communication in circuit-switched multi-hop networks by showing, despite the fact that the general multicast problem is NP-hard, it is polynomially solvable when the optimization objective is the wavelength assignment only. For constructing constrained multicast trees in WDM networks, Bermond et al [8] investigated routing and wavelength assignment with only unicast-capable switches.…”

Section: Introductionmentioning

confidence: 99%

Online Multicasting in WDM Networks with Shared Light Splitter Bank

Liu

Liang

2007

NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

Abstract. We study online multicasting in WDM networks with shared light splitter bank. Our objective is to maximize the network throughput. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. We first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modelling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.

show abstract

Multicast routing and wavelength assignment in multihop optical networks

Cited by 76 publications

References 17 publications

A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks

A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks

Online multicasting in WDM networks with shared light splitter bank

Online Multicasting in WDM Networks with Shared Light Splitter Bank

Contact Info

Product

Resources

About