Ahmed Frikha, Bernard Cousin, and Samer Lahoud (2011)
Extending Node Protection Concept of P-Cycles for an Efficient Resource Utilization in Multicast Traffic
In: 36th Annual IEEE Conference on Local Computer Networks (LCN 2011), Bonn, Germany.
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.