List of shared risk link groups representing regional failures with limited size

@article{Tapolcai2017ListOS,
  title={List of shared risk link groups representing regional failures with limited size},
  author={J{\'a}nos Tapolcai and Lajos R{\'o}nyai and B{\'a}lazs Vass and L{\'a}szl{\'o} Gyim{\'o}thi},
  journal={IEEE INFOCOM 2017 - IEEE Conference on Computer Communications},
  year={2017},
  pages={1-9}
}
Shared Risk Link Group (SRLG) is a failure the network is prepared for, which contains a set of links subject to a common risk of single failure. During planning a backbone network, the list of SRLGs must be defined very carefully, because leaving out one likely failure event will significantly degrade the observed reliability of the network. Regional failures are manifested at multiple locations of the network, which are physically close to each other. In this paper we show that operators… 
Enumerating Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes
TLDR
The aim of the paper is to bring the conventional SRLG based pre-planned protection and regional failures closer to each other by providing a systematic approach to generate the list of SRLGs for regional failures.
Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size
TLDR
It is shown that operators should prepare a network for only a small number of possible regional failure events and an approach to generate the list of SRLGs that hit every possible circular disk shaped disaster of a given radius is given.
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters
TLDR
A stochastic model of geographically correlated link failures caused by disasters is built to estimate the hazards an optical backbone network may be prone to and to understand the complex correlation between possible link failures.
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters
TLDR
A stochastic model of geographically correlated link failures caused by disasters is built, in order to estimate the hazards a network may be prone to, and to understand the complex correlation between possible link failures.
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
TLDR
Auxiliary algorithms for obtaining the shortest path from a source to a destination are presented in detail, followed by the illustrated description of Bhandari’s and Suurballe's algorithms for obtain a pair of paths of minimal total additive cost.
How to Model and Enumerate Geographically Correlated Failure Events in Communication Networks
TLDR
This chapter overviews how state-of-the-art algorithmic approaches for generating lists of (P)SRLGs of the communication networks protecting different sets of disasters can be added to the existing network protocols through defining shared risk link groups (SRLG) and probabilistic SRLGs (PSRLGs).
Improving the Connectivity Resilience of a Telecommunications Network to Multiple Link Failures Through a Third-Party Network
  • A. Sousa
  • Computer Science
    2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020
  • 2020
TLDR
In this work, the connectivity resilience to multiple link failures is improved by resorting to a third-party network for temporary additional connectivity (i.e., while the failing links are not reestablished), and a Gateway Node Selection (GNS) algorithm is proposed where a set cover problem type is defined and solved to select the gateway nodes.
Vulnerable Regions of Networks on Sphere
TLDR
This work focuses on algorithms for listing SRLGs as a result of regional failures of circular shape, and generalizes some of the related results on plane to sphere.
Bonsai: Efficient Fast Failover Routing Using Small Arborescences
TLDR
This paper revisits the existing approach to cover the to-be-protected network with arc-disjoint spanning arborescences to define alternative routes to the destination, aiming to keep the stretch imposed by these trees low, and shows that the underlying problem is NP-hard on general topologies and presents lower bound results that are tight for various topologies, for any class of fast failover algorithms.
Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort
The resilience to disasters is a very relevant problem in telecommunication networks. This work addresses the problem of 1 + 1 optical lightpath protection considering maximally shared risk link
...
1
2
3
...

References

SHOWING 1-10 OF 35 REFERENCES
SRLG-diverse routing with the star property
TLDR
This paper provides counterexamples to the polynomial time algorithm proposed in [1] for computing a pair of SRLG-disjoint paths in networks with SRLGs satisfying the star property, and proves that this problem is in fact NP-complete.
Measuring the survivability of networks to geographic correlated failures
Finding critical regions in a network
TLDR
This paper studies the problem of finding a critical region - that is, a part of the network that can be enclosed by a given elementary figure with a predetermined size - whose removal would lead to the highest network disruption.
The resilience of WDM networks to probabilistic geographical failures
TLDR
The paper uses computational geometric tools to provide efficient algorithms to identify vulnerable points within the network under various metrics and obtains numerical results for specific backbone networks, thereby demonstrating the applicability of the algorithms to real-world scenarios.
Power grid vulnerability to geographically correlated failures — Analysis and control implications
TLDR
Inspired by methods developed for network-survivability analysis, it is shown how to identify the most vulnerable locations in the network and can indicate potential locations for grid monitoring, and hence, will have impact on the deployment of the smart-grid networking infrastructure.
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
TLDR
A novel approach that aims to identify the most vulnerable parts of the network, that is, the locations of disasters that would have the maximum disruptive effect on the network in terms of capacity and connectivity, and obtains numerical results for a specific backbone network, thereby demonstrating the applicability of the algorithms to real-world networks.
Finding geographic vulnerabilities in multilayer networks using reduced network state enumeration
TLDR
A state space analysis method is presented that analyzes multilayer networks for geographic vulnerabilities that uses either the inability to provision an upper layer service and/or increased costs to provision as the criteria for network failure.
Studying (non-planar) road networks through an algorithmic lens
This paper studies real-world road networks from an algorithmic perspective, focusing on empirical studies that yield useful properties of road networks that can be exploited in the design of fast
Design of Disaster-Resilient Optical Datacenter Networks
TLDR
The disaster protection scheme exploiting anycasting provides more protection, but uses less capacity than dedicated single-link failure protection, and it is shown that a reasonable number of datacenters and selective content replicas with intelligent network design can provide survivability to disasters while supporting user demands.
Detection of spatially-close fiber segments in optical networks
TLDR
Three algorithms for detecting all the spatially-close fiber segments of different fibers, a polynomial-time algorithm for finding the spatial-close intervals of a fiber to a set of other fibers, and a fast exact algorithm for grouping spatially -close fibers using the minimum number of distinct risk groups are proposed.
...
1
2
3
4
...