Optimization of wavelength assignment for QoS multicast in WDM networks

Jia, Xiaohua; Du, Ding‐Zhu; Hu, Xiaodong; Lee, Man-Kei; Gu, Jun

doi:10.1109/26.905896

Cited by 88 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, in Fig. 1b, the working trees are routed in both directions of the edges (1, 2), (1,6), (6,5), (5,3), (5,4), forming an undirected tree.…”

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

See 1 more Smart Citation

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Samonaki,

Mas-Machuca

2024

2024 20th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

This paper studies the problem of optimal and reliable routing for multicast sessions in wavelength-divisionmultiplexing (WDM) networks. The objective is to minimize the cost and the blocking probability when establishing several multicast sessions while guaranteeing protection against any single link failure. In the presence of static traffic, two different Integer Linear Programming (ILP) formulations, Joint ILP 1 and Joint ILP 2, find the working trees and the link-disjoint backup paths for the sessions simultaneously, with Joint ILP 2 choosing a specific number of links to route the working trees. The proposed ILPs reduce the cost by 25 -30 % while coping with a larger number of demands per session compared to stateof-the-art solutions. This work also addresses the problem in a dynamic environment, with sequential multicast sessions of random demands, by proposing an ILP for the optimal solution and a heuristic called Demand-Aware Tree-Forming Optimal Path Pairs (DA-TF-OPP). Dealing with one multicast session at a time, DA-TF-OPP takes into account the sequence in which the demands should be routed and provides a working tree to prevent traffic loops, along with the backup paths. Compared to the state-of-the-art, DA-TF-OPP provides up to 5 % lower average cost and up to 3 % lower average blocking probability.

show abstract

“…On the other hand, in Fig. 1b, the working trees are routed in both directions of the edges (1, 2), (1,6), (6,5), (5,3), (5,4), forming an undirected tree.…”

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

“…joint project 6G-life, project identification number 16KISK002. reduce the required wavelengths, achieve minimum routing costs, and provide the best quality of service [1], [2].…”

Section: Introductionmentioning

confidence: 99%

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Samonaki,

Mas-Machuca

2024

2024 20th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

show abstract

“…There are many multicast applications, such as news feeds, video distribution, multimedia conferencing, and so on. It is a challenging job to implement multicast in Wide Area Networks (WANs) due to high complexity of multicast routing [10,13]. Multicast routing is to find a tree rooted from the source and connecting all the destinations.…”

Section: Introductionmentioning

confidence: 99%

Multicast routing and wavelength assignment in WDM networks with limited drop-offs

Hu¹,

Shuai²,

Jia

et al.

Ieee Infocom 2004

View full text Add to dashboard Cite

Abstract-In WDM networks with limited drop-offs, the route of a multicast connection consists of a set of light-trees. Each of the light-tree is rooted at the source node and contains no more than a limited number, say k, destination nodes due to the power loss of dropping optical signals off at destination nodes. We call such a light-tree k-drop light-tree. In this paper we study the multicast routing problem of constructing a set of k-drop lighttrees that have the minimal network cost. The network cost of a set of light-trees is defined as the summation of the link cost of all the light-trees. We first prove that this problem is polynomialtime solvable for k = 2 and NP -hard for k ≥ 3. We then propose a 4-approximation algorithm for the problem for k ≥ 3. A wavelength assignment algorithm is also proposed to assign wavelengths to the light-trees of a multicast connection. In the end we give simulation results showing that k-drop multi-tree routing can significantly save not only the network cost but also wavelengths used. Moreover, when k ≥ 5 its performance is very close to the case where k is infinite (i.e., the case of using a single tree for a multicast connection).

show abstract

Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks

Yang

Huang

2016

Int J Communication

View full text Add to dashboard Cite

Summary Given a sparse‐splitting wavelength‐division multiplexing network with no wavelength converter, we study a group multicast problem that is how to transmit a number of multicast streams from the video server to multiple destinations simultaneously. To avoid the situation that the wavelengths are used up by the first few requests, one wavelength is available for each multicast request. Hence, some of destinations may not be included in the multicast trees because of the lack of wavelengths. Our goal is to construct a number of light trees with conflict‐free wavelengths for multiple requests so that the number of served clients is maximized. This problem is named as the revenue‐maximized and delay‐constrained group multicast routing problem. We first determine a set of multicast trees with the maximum number of served clients, then followed by the wavelength assignment to allocate the minimum number of wavelengths to the resulting trees. In this study, we propose two Integer Linear Programming ILP‐based algorithms for determining the optimal solutions for the light‐tree construction problem and the wavelength assignment problem, respectively. For large‐scale networks, two heuristics are introduced to solve the light‐tree construction problem approximately. A set of simulations are also provided for comparing performances of our algorithms against the other published methods. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Optimization of wavelength assignment for QoS multicast in WDM networks

Cited by 88 publications

References 14 publications

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Multicast routing and wavelength assignment in WDM networks with limited drop-offs

Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks

Contact Info

Product

Resources

About