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

Abstract

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.

Cost-Efficient Mapping for Fault-Tolerant Virtual Networks

“…In [27], the authors propose a node and link failure protection approach in the context of optical networks. The main focus is on the physical layer; no information is provided about the upper VN layer.…”

“…Constraints (26) guarantee the flow conservation along intermediate nodes of the p-cycle. Constraints (27) ensure that a virtual segment and a p-cycle cannot share any substrate link. Constraints (28) indicate that only linkdisjoint virtual segments can share a p-cycle.…”

“…Some studies deal with providing resilience for VN mapping, but the most frequently proposed protection approaches deal with physical link failure [21], [22], [36], [39], [40], [41]. Only a very few proposals [25], [26], [27], [37], [38] consider backup mechanisms in the event of a physical node failure. This protection is desirable because the impact of node failure is more severe, especially in a context of network virtualization.…”

Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles

“…The ESHN algorithm achieves the best resource utilization and has the lowest blocking probability among the OPP-SDP algorithm [5] and the ESHT algorithm in dynamic multicast traffic. In [8], we proposed two new algorithms for link and node protection using p-cycles, named NPC and NPCC. The NPC algorithm achieves the lowest blocking probability, but has the highest computational time among the NPCC and ESHN algorithms.…”