Distance priority based multicast routing in WDM networks considering sparse light splitting

Abstract-In this paper, we study the node and link protection using p-cycles for dynamic multicast sessions in alloptical DWDM networks. First, we propose a new concept for protecting nodes of light-trees under the sparse light-splitting and wavelength continuity constraints. Then, we integrate our concept in a novel algorithm, named node and link protecting candidate p-cycles based algorithm with sparse light-splitting constraints (NPCC-SSC). Our algorithm enables both node and link failure recovery in dynamic multicast traffic. Extensive simulations show that the NPCC-SSC algorithm achieves the best resource utilization, and outperforms the existing approaches in terms of blocking probability and computational time.

show abstract

“…Otherwise, the request is rejected. Note that the requests are routed using the algorithm described in [12].…”

Section: The Proposed Algorithmsmentioning

confidence: 99%

Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles

Frikha

Lahoud

Cousin

et al. 2012

2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)

Self Cite

View full text Add to dashboard Cite

show abstract

“…To ensure the effectiveness of our proposed multicast routing algorithm, two different network topology are employed as test beds for the simulation:the 14 nodes NSF network Figure 2 as well as the 28 nodes USA Longhaul network in Figure 10. These networks has been used as a reference topology in many papers [5,7,10,14,16,17], that is why we select them. …”

Section: Performance Evaluation and Simulationmentioning

confidence: 99%

Avoidance of multicast incapable branching nodes for multicast routing in WDM networks

Zhou

Molnar

Cousin

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

Self Cite

View full text Add to dashboard Cite

In this paper, we study the multicast routing problem in all-optical WDM network under the spare light splitting constraint. To implement a multicast session, several light-trees may have to be used due to limited fanouts of network nodes. Although many multicast routing algorithms have been proposed in order to reduce the total number of wavelength channels used (total cost) for a multicast session, the maximum number of wavelengths required in one fiber link (link stress) and the end-to-end delay are two parameters which are not always taken into consideration. As we know, the shortest path tree results in the optimal delay, but it can not be employed directly for multicast routing in sparse splitting WDM networks. Hence, we propose a novel wavelength routing algorithm, which tries to avoid the multicast incapable branching nodes (MIB, branching nodes without splitting capability) in the shortest path based multicast tree to diminish the link stress and maintains good parts of the shortest path tree to reduce the end-to-end delay. The given algorithm consists of tree steps: (1)DijkstraPro algorithm with priority assignment and node adoption is intro- duced to produce a shortest path tree with up to 38% fewer MIB nodes in NSF topology and 46% fewer MIB nodes in USA Longhual Topology. (2)critical articulation and deepest branch heuristics are used to process the MIB nodes, (3)distance based reconnection algorithm is proposed to create the multicast light-trees. Extensive simulations demontrate its efficiency in terms of link stress and end-to-end delay.

show abstract

“…But, in order to support multicast, the optical switches should be equipped with optical splitters to split the light signal into several branches. In the case of sparse splitting [5], where only a small fraction of network nodes are capable of splitting, the light-forest [6] concept is introduced, which was focused by many researches [7,15,16]. To improve the multicast routing again and save more fiber channel cost, a new structure called light-hierarchy is investigated in [13].…”

mentioning

confidence: 99%

All-optical multipoint-to-point routing in WDM mesh networks

Zhou¹,

Molnár²,

Cousin³

2010

Ann. Telecommun.

Self Cite

View full text Add to dashboard Cite

In this article, the routing and wavelength assignment (RWA) problem for supporting multipointto-point communications in all-optical WDM mesh networks is investigated. Two efficient algorithms, namely Reverse Shortest Path Tree routing (RSPT) and kBounded Edge Disjoint Path routing (EDPR), are proposed. We proved that the problem of minimizing the total cost while establishing a multipoint-to-point session can be solved in polynomial time of O(|V |log|V | + |V | + |E|) by the RSPT algorithm, where |V | and |E| denote the number of nodes and the number of edges in the network respectively. Nevertheless, the solution provided by the EDPR algorithm produces a significant reduction in the maximum number of wavelengths required per link (i.e., the link stress) for a multipointto-point session compared to RSPT algorithm. EDPR algorithm can also approximate to the optimal total cost with a ratio of k. Simulations are done to assess these two algorithms. Numerical results demonstrate their efficiencies in supporting multipoint-to-point communications in all-optical WDM networks.A preliminary version of part of this work was presented in [14] at IEEE LCN 2009, Zürich.

show abstract

Distance priority based multicast routing in WDM networks considering sparse light splitting

Cited by 11 publications

References 9 publications

Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles

Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles

Avoidance of multicast incapable branching nodes for multicast routing in WDM networks

All-optical multipoint-to-point routing in WDM mesh networks

Contact Info

Product

Resources

About