Grooming of multicast sessions in WDM ring networks

Abstract

In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks. In order to support multicasting, individual nodes need to have the capability to duplicate traffic. We consider two different node architectures which perform the duplication in optical and electronic domain, respectively. As traffic duplication at the electronic level is much more expensive than the optical alternative, we study the problem of assigning routes and wavelengths to the multicast sessions so as to minimize electronic copying. The solution to this problem can be divided into three phases -1 . routing of multicast sessions, 2. construction of circles by grouping non-overlapping arcs and 3. grouping these circles onto wavelengths. We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles. We present extensive simulation results to show that our approach leads to much lesser equipment cost than that obtained by routing each multicast session along its minimum spanning tree and then using the best known heuristic for circle construction.'

Grooming multicast traffic in unidirectional SONET/WDM rings

“…The problem that we study here is quite different from the problem studied in [20]. The main difference, other than the fact that we study unidirectional rings while [20] looks at bidirectional rings, is that the cost function used is different.…”

“…Although most of the work on multicast traffic grooming looks at mesh WDM networks, there has been some work in the case of WDM rings also. More specifically, in [20] the authors look at the problem of grooming given multicast traffic demands in a bidirectional WDM ring. They present a heuristic algorithm inspired by the algorithm to groom unicast traffic demands on WDM rings given in [1].…”

“…The main difference, other than the fact that we study unidirectional rings while [20] looks at bidirectional rings, is that the cost function used is different. We consider the number of ADMs and the number of wavelengths required per fiber as our cost, whereas in [20], the total number of ports of e-DAC nodes in the network is considered as the cost. In [20], the authors define two different types of nodes, o-DAC and e-DAC nodes.…”

Multicast traffic grooming in wavelength-routed WDM mesh networks using dynamically changing light-trees

“…Recently, the multicast traffic grooming problem has begun to attract research attention [8]- [10]. All of these papers studied the multicast traffic grooming problem based on the lightpath wavelength channel model and approached the problem using integer linear programming (ILP) and heuristics.…”

Grooming-Enhanced Multicast in Multilayer Networks

“…Madhyastha et al proposed in [2] a heuristic method for the problem of multicast routing and wavelength assignment in WDM ring networks. They proposed new node architectures with electronic or optical Drop-and-Continue (D&C) feature.…”