Protecting multicast services in optical internet backbones

Abstract

Many applications in the future Internet will use the multicasting service mode. Since many of these applications will generate large amounts of traffic, and since users expect a high level of service availability, it is important to provision multicasting sessions in the future Internet while also providing protection for multicast sessions against network component failures. In this paper we address the multicast survivability problem of using minimum resources to provision a multicast session and its protection paths (trees) against any single-link failure. We propose a new, and a resource efficient, protection scheme, namely, Segment-based Protection Tree (SPT). In SPT scheme, a given multicast session is first provisioned as a primary multicast tree, and then each segment on the primary tree is protected by a multicast tree instead of a path, as in most existing approaches. We also analyze the recovery performance of SPT and design a Reconfiguration Calculation Algorithm to compute the average number of reconfigurations upon any link failure. By extending SPT to address dynamic traffic scenarios, we also propose two heuristic algorithms, Cost-based SPT (CB SPT) and Wavelength-based SPT (WB SPT). We study the performance of the SPT scheme in different traffic scenarios. The numerical results show that SPT outperforms the best existing approaches, optimal path-pair-based shared disjoint paths (OPP SDP). SPT uses less than 10% extra resources to provision a survivable multicast session over the optimal solution and up to 4% lower than existing approaches under various traffic scenarios and has an average number of reconfigurations 10-86% less than the best cost efficient approach. Moreover, in dynamic traffic cases, both CB SPT and WB SPT achieves overall blocking probability with 20% lower than OPP SDP in most network scenarios.

Reliable Provisioning of Low-Latency and High-Bandwidth Extended Reality Live Streams

“…They proposed a service-provisioning scheme, named multicast protection through spanning paths, where a primary multicast tree is protected using backup network resources which are shared between different multicast sessions. In [17], the authors addressed the problem of multicast survivability. They proposed a solution where a multicast session is provisioned as the primary multicast tree with each of its segment being protected by another backup multicast tree.…”

“…(1) (lines [17][18]. If the end-to-end latency fulfills the required latency, the incoming XR live stream request is admitted and the algorithm updates and returns the bandwidth reserved on each link, throughput reserved on each node, computing and storage resources reserved in each serving DC using the hash maps ∆, Σ, Φ, and Ψ (line [19][20][21][22].…”

Survivability and performance optimization in communication networks using network coding

“…In [21] authors present a slightly modified MPH algorithm to provide better blocking probability in arc-disjoint tree protection. In [63] authors devise tree-based protection to protect each segment on the primary tree.…”