Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks

Abstract

In this paper, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. First, we study these approaches and algorithms to protect a single multicast tree in a mesh network and then extend it to dynamically provision survivable multicast connections (where connections come and go) in an optical wavelength-division multipexing (WDM) network.We propose two new and efficient approaches for protecting a multicast session: 1) segment protection in which we protect each segment in the primary tree separately (rather than the entire tree) and allow these backup segments to share edges with the other existing primary and backup segments and 2) the path-pair protection in which we find a path-pair (disjoint primary and backup paths) to each destination and allow a new path pair to share edges with already-found path pairs. Unlike previous schemes, such as finding link-disjoint trees and arc-disjoint trees, our new schemes 1) guarantee a solution where previous schemes fail and 2) find an efficient solution requiring less network resources. We study these approaches and algorithms systematically, starting with the existing approaches such as fully link-disjoint and arc-disjoint trees and then presenting our new and efficient proposed approaches, such as segment-disjoint and path-disjoint schemes for protecting multicast connections. Our most efficient algorithm, based on the path-pair protection scheme, called optimal path-pair-based shared disjoint paths (OPP-SDP) algorithm, finds a solution if such a solution exists and outperforms all the other schemes in terms of network cost. We also show that OPP-SDP performs close to the optimal solution obtained by solving a mathematical formulation of the problem expressed as an integer linear program.Building upon the study on protecting a single tree, we perform simulations, employing the above protection schemes, to study dynamic provisioning of survivable multicast sessions (where sessions come and go) in a WDM mesh network. Our simulations show that the most efficient scheme, OPP-SDP, has minimum blocking probability.Index Terms-Arc disjoint, backup tree, dynamic provisioning, fiber cut, link disjoint, link failure, mesh network, multicasting, optimal path pair (OPP), protection, segment disjoint, wavelengthdivision multiplexing (WDM).

Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks

“…Five major multicast protection approaches are proposed in the literature and most of them focus on link failure recovery: 1) tree-based protection [1]- [2]- [3], 2) path-based protection [4]- [5], 3) segment-based protection [6]- [7], 4) ring-based protection [8]- [9], and 4) p-cycle (preconfigured protection cycle) based protection [10]- [11]. In [12], G. Xue et al propose to deploy two link-disjoint light-trees: an active lighttree and a backup light-tree.…”

“…Work in [1] relaxes the disjointness constraint from link-disjoint to arc-disjoint, but this proposition suffers from the same problems. In 2003, N. Singhal et al proposed two algorithms based on the optimal path pair protection approach (OPP): 1) the OPP-based shared disjoint path (OPP-SDP) algorithm [8], 2) the OPP-based shared disjoint segment (OPP-SDS) algorithm [8]. Note that the OPP approach is based on the algorithm described in [13] to compute a pair of link-disjoint paths from a source to every destination.…”

Protecting Multicast Sessions in WDM Networks with Sparse-Splitting Constraints

“…Survivability is an important issue in WDM networks [2]. Protecting a multicast session from a single link failure in WDM networks with or without a sparse-splitting constraint has been studied in recent literature [2]- [6].…”

“…Protecting a multicast session from a single link failure in WDM networks with or without a sparse-splitting constraint has been studied in recent literature [2]- [6]. Existing multicast protection algorithms can be classified into the following four types: link-disjoint tree [2], [3]; link protection [4]; segment protection [2], [5]; and path-based [4], [6] algorithms. However, with the sparse-splitting constraint, the backup paths derived by existing algorithms cannot share wavelength with the working tree.…”

Reliability evaluation by expected achievable capacity in stochastic network using game theory

“…Whenever possible, those links or nodes that are significant to the network performance must be made reliable. In the conventional analysis of network reliability and restoration design [1]- [5], the most common assumption is that link/node failure events occur either one at a time or in a simplified random manner. This assumption is well justified for failures occurring naturally.…”