Candidate-Cycle-based Heuristic Algorithm for Node-and-Link Protection of Dynamic Multicast Traffic in Optical DWDM Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Candidate-Cycle-based Heuristic Algorithm for Node-and-Link Protection of Dynamic Multicast Traffic in Optical DWDM Networks

Ahmed Frikha
  • Fonction : Auteur
  • PersonId : 914142
Samer Lahoud

Résumé

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-and-link 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.
Fichier principal
Vignette du fichier
ICOIN.pdf (228.43 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00677166 , version 1 (07-03-2012)

Identifiants

Citer

Ahmed Frikha, Samer Lahoud, Bernard Cousin. Candidate-Cycle-based Heuristic Algorithm for Node-and-Link Protection of Dynamic Multicast Traffic in Optical DWDM Networks. The 26th International Conference on Information Networking (ICOIN) 2012, Feb 2012, Bali, Indonesia. ⟨10.1109/ICOIN.2012.6164347⟩. ⟨hal-00677166⟩
345 Consultations
98 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More