Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

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

Résumé

In this paper, we consider link-and-node failure recovery in dynamic multicast traffic in WDM networks. We extend the node protection concept of the p-cycle approach to achieve more efficient resource utilization. Then, we propose a novel algorithm that integrates our concept for the node protection, named node-and link protecting p-cycle based algorithm (NPC). We also propose a second algorithm, named node-and-link protecting candidate p-cycle based algorithm (NPCC). This algorithm deploys our concept for node protection and relies on a candidate p-cycle set to speed up the computational time. We compare our proposed algorithms to the ESHN algorithm, which is reported to be the most efficient algorithm for protecting dynamic multicast sessions. Extensive simulations show that the NPC algorithm achieves the lowest blocking probability, but has the highest computational time among the NPCC and ESHN algorithms. The NPCC algorithm outperforms the ESHN algorithm in terms of resource utilization efficiency and computational time.
Fichier principal
Vignette du fichier
LCN.pdf (278.51 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

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

Identifiants

Citer

Ahmed Frikha, Bernard Cousin, Samer Lahoud. Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic. IEEE 36th Conference on Local Computer Networks (LCN), Oct 2011, Bonn, Germany. pp.175-178, ⟨10.1109/LCN.2011.6115180⟩. ⟨hal-00677163⟩
372 Consultations
191 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More