Design and analysis of five protection schemes for preplanned recovery in multicast WDM networks

Leelarusmee, P.; Boworntummarat, C.; Wuttisittikulkij, Lunchakorn

doi:10.1109/sarnof.2004.1302867

Cited by 26 publications

(27 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multicast protection and restoration in optical mesh networks have been studied extensively in recent work. A wide range of multicast protection algorithms and strategies [6][7][8][9][10][11][12][13] have been proposed to make the multicast sessions survivable after various failure scenarios such as fiber cut and duct cut. A primary light-tree itself needs a large number of network resources, and the protection consumes more bandwidth.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks

Zhang

2010

Photon Netw Commun

View full text Add to dashboard Cite

As multicast applications become more and more popular, implementing multicast in the optical domain has attracted increased attention due to its more efficient bandwidth usage. And also these services have quality-of-service requirements. In this article, the problem of cost-effective optical multicast provisioning to satisfy the differentiated leaf availability requirements is formally stated. A Mixed Integer Linear Program formulation is proposed for provisioning dedicated light-tree protection with differentiated leaf availability guarantee. The algorithm is so complex and infeasible that we also propose a feasible two-step approximate approach to solve the problem. Different from the previous schemes, our scheme finds out the primary light-trees and backup paths for destination nodes whose availability is not satisfied. Because of taking the different leaf availability requirements into account, the proposed algorithm obtains a more efficient feasible solution requiring less network resources.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Two multicast protection schemes, namely one ring for one session and one ring for all sessions, have been proposed in [11,12]. Each multicast session is allocated in a separated and dedicated ring.…”

Section: Related Workmentioning

confidence: 99%

Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks

Zhang

2010

Photon Netw Commun

View full text Add to dashboard Cite

show abstract

“…Five major multicast protection approaches are proposed in the literature and most of them focus on link failure recovery: 1) tree-based protection [1]- [2]- [3], 2) path-based protection [4]- [5], 3) segment-based protection [6]- [7], 4) ring-based protection [8]- [9], and 4) p-cycle (preconfigured protection cycle) based protection [10]- [11]. In [12], G. Xue et al propose to deploy two link-disjoint light-trees: an active lighttree and a backup light-tree.…”

Section: Introductionmentioning

confidence: 99%

Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks

Frikha

Lahoud

Cousin

2012

The International Conference on Information Network 2012

View full text Add to dashboard Cite

Abstract-Maintaining survivability of DWDM networks is crucial to multicast traffic. A link-or-node failure has a severe impact on optical multicast sessions as it can prune several communications simultaneously. In this paper, we present a novel candidate-cycle-based heuristic algorithm for node-andlink protection (CCHN) in dynamic multicast traffic. CCHN is based on p-cycle protection concept. The p-cycle concept ensures a fast restoration time and an efficient use of network capacity. Extensive simulations show that the blocking probability of our algorithm is lowest. Furthermore, the computational time of our algorithm is very low compared with the existing approaches, especially when traffic load is high.

show abstract

“…Five major multicast protection approaches are proposed in the literature and most of them focus on link failure recovery: 1) tree-based protection [1]- [2]- [3], 2) path-based protection [4]- [5], 3) segment-based protection [6]- [7], 4) ring-based protection [8]- [9], and 4) p-cycle (preconfigured protection cycle) based protection [10]- [11]. In [12], G. Xue and al. propose to deploy two link-disjoint light-trees: an active light-tree and a backup light-tree.…”

Section: Introductionmentioning

confidence: 99%

Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic

Frikha

Cousin

Lahoud

2011

2011 IEEE 36th Conference on Local Computer Networks

View full text Add to dashboard Cite

Abstract-Optical network survivability becomes indispensable with the emerging wavelength-division multiplexing (WDM) technologies such as the DWDM technology. Particularly, for optical multicast sessions, a link-or-node failure has a severe impact as it can prune several communications simultaneously. The p-cycle approach ensures node-and-link failure recovery while maintaining a fast restoration time and an efficient use of the network capacity compared to the other protection approaches. Up to now, most researches on link-and-node failure recovery in optical light trees have deployed limited approaches for node protection. These approaches do not use efficiently the protection capacity provided by a p-cycle when protecting nodes.In this paper, we extend the node protection concept of the pcycle approach for an efficient resource utilization in a dynamic multicast traffic. Then, we propose two novel algorithms that integrate our concept for the node protection, named NPC and NPCC. These algorithms enable node-and-link failure recovery. We compare our algorithms with the ESHN algorithm, which is reported to be the most efficient heuristic algorithm for protecting dynamic multicast sessions in WDM networks. Extensive simulations show that the NPC algorithm achieves the best resource utilization, while the NPCC algorithm outperforms the ESHN algorithm in terms of blocking probability and computational time.

show abstract

Design and analysis of five protection schemes for preplanned recovery in multicast WDM networks

Cited by 26 publications

References 11 publications

Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks

Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks

Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks

Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic

Contact Info

Product

Resources

About