2020
DOI: 10.1007/978-3-030-44685-7_17
|View full text |Cite
|
Sign up to set email alerts
|

Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios

Abstract: Disjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k > 2) link-(or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links in any single SRLG. Paths traversing disaster-prone regions should be disjoint, but … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…In our simulations we calculated the minimum length control paths depending on the current link failures with three shortest path approaches. First, as a reference on the basic topological properties, we show the minimum length switch-tocontroller paths calculated with Dijkstra's algorithm [43], which does not take into account the hypervisor locations (P (s, c) in the figures). As a second approach we use Alg.…”
Section: Minimum Length Vsdn Control Paths Upon Link Failuresmentioning
confidence: 99%
“…In our simulations we calculated the minimum length control paths depending on the current link failures with three shortest path approaches. First, as a reference on the basic topological properties, we show the minimum length switch-tocontroller paths calculated with Dijkstra's algorithm [43], which does not take into account the hypervisor locations (P (s, c) in the figures). As a second approach we use Alg.…”
Section: Minimum Length Vsdn Control Paths Upon Link Failuresmentioning
confidence: 99%
“…This will not lead to revising the set of used route calculation algorithms -Dijkstra, Bellman-Ford, DUAL. However, as the analysis has shown, an approach based on the departure from using graph models for finding the shortest path in a graph and the listed combinatorial optimization algorithms is becoming increasingly common among scientists dealing with routing problems [13][14][15][16]. The power of contemporary routers makes it possible to use more modern but also more computationally complex optimization models, methods, and computational 2 algorithms, in which, at the level of optimization criteria and introduced constraints, it is possible to more adequately consider the requirements for the values of certain QoS and network security indicators.…”
Section: Introductionmentioning
confidence: 99%
“…In some reliability and survivability problems in telecommunications, it is common to require pairs of paths linking two nodes, which minimize a cost function and simultaneously can work as alternatives in case a failure occurs along the first one (Hu, 2003; Gomes et al., 2020). Such paths are known as the primary and backup paths.…”
Section: Introductionmentioning
confidence: 99%