Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection

Authors:
Der-Rong Din;Chian-Ya Hong;Hsiao-Suang Yen;Ya-Hsin Chuang;Xin-Kai Lin
Affiliations:
Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua City, R.O.C. 500;Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua City, R.O.C. 500;Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua City, R.O.C. 500;Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua City, R.O.C. 500;Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua City, R.O.C. 500
Venue:
Photonic Network Communications
Year:
2013

Citing 8
Cited 0

Finding the k Shortest Paths

SIAM Journal on Computing
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Optical WDM Networks (Optical Networks)

Optical WDM Networks (Optical Networks)
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Artificial Intelligence Review
Delay-constrained survivable multicast routing problem in WDM networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a delay-constrained multicast transmission request, the goal of delay-constrained survivable multicast routing problem is to provide the primary multicast tree and the tree protecting sparse resources. The shared segment-based protection (SSBP) method is used in this article to protect the delay-constrained multicast transmission. Two heuristic methods are proposed to find the delay-constrained primary tree and the backup segments with delay constraint. Experiments are conducted to evaluate the performance of the proposed methods, and the performance to be evaluated includes wavelength efficiency ratio (WER), blocking ratio (BR), and executing time. Simulations show that the SSBP method can get better BR and WER than the previous results demonstrated Din and Jiang (Comput Commun 35(10):1172---1184, 2012).