Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Gomes, Teresa; Jorge, Luísa; Melo, Paulo; Girão‐Silva, Rita

doi:10.1007/s11107-015-0524-0

Cited by 13 publications

(17 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we are not considering that SRLGs are associated to a duct or a cable with a set of links, but rather as a way to represent geographically correlated failures. That is also why: (i) we find SRLGs as explained in ; (ii) we are not calculating paths based on minimal total SRLG length, as we did in the previous study . In that previous work, actual information from an existing network was taken into account and SRLGs actually represented a duct or a cable, unlike what is considered here.…”

Section: Introductionmentioning

confidence: 93%

“…The formulation for node‐disjoint path pairs, for a demand originating in node s and terminating in node t (similar to the link‐disjoint formulation in ), is presented next:

\min {false\sum}_{k = 1}^{| A |} ℓ_{k} (x_{k, 1} + x_{k, 2})

subject to: Constraints (1), (10)–(14) and

μ_{italicst} = {false\sum}_{r = 1}^{ϱ} g_{r} .

…”

Section: Addressed Problemsmentioning

confidence: 99%

“…In cases when it is not possible to find fully SRLG‐disjoint paths, one may try and find maximally SRLG‐disjoint paths . That is the problem to be considered in this work.…”

Section: Introductionmentioning

confidence: 99%

“…This paper is an extension of . Experiments are performed on different networks of the sndlib set for which different SRLG sets were devised as in , allowing to model geographically correlated failures. Given that geodiversity requires node‐disjointness, we have formulated and solved a problem of maximally SRLG‐disjoint paths among node‐disjoint path pairs.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

et al. 2020

Self Cite

View full text Add to dashboard Cite

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 group (SRLG)‐disjoint geodiverse paths, applied in the context of an optical network. The resilience to geographically correlated disasters is accomplished by guaranteeing geodiversity of the paths. This work focuses on estimating the increase of the path lengths and the increase in cost of the required transponders, compared to simple link‐disjointness (i.e., when no constraints on SRLG‐disjointness or geodiversity are considered). Results in different networks allow to evaluate the effect of SRLG‐disjointness to ensure some geodiversity.

show abstract

Section: Introductionmentioning

confidence: 93%

“…The formulation for node‐disjoint path pairs, for a demand originating in node s and terminating in node t (similar to the link‐disjoint formulation in ), is presented next:

\min {false\sum}_{k = 1}^{| A |} ℓ_{k} (x_{k, 1} + x_{k, 2})

subject to: Constraints (1), (10)–(14) and

μ_{italicst} = {false\sum}_{r = 1}^{ϱ} g_{r} .

…”

Section: Addressed Problemsmentioning

confidence: 99%

“…In cases when it is not possible to find fully SRLG‐disjoint paths, one may try and find maximally SRLG‐disjoint paths . That is the problem to be considered in this work.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…There has been some efforts to address this challenge by choosing a pair of maximally disjoint SRLG paths; i.e. a pair of paths that share the minimum number of risks [2], [10], [11]. Clearly, this cannot survive any single failure; thus, we take an alternative approach that is based on finding a set of paths that together will survive any single failure.…”

Section: Introductionmentioning

confidence: 99%

Survivable Path Sets: A New Approach to Survivability in Multilayer Networks

Parandehgheibi

Lee

Modiano

2014

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-We consider the problem of survivability in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where risk-disjoint paths may not always exist. In this paper, we take a new approach which is based on finding a set of paths that may not be disjoint but together will survive any single risk. We start with two-layered communication networks where the risks are fiber failures. We prove that in general, finding the minimum survivable path set (MSPS) is NP-hard, whereas if we restrict the length of paths the problem can be solved in polynomial time. We formulate the problem as an Integer Linear Program (ILP), and use this formulation to develop heuristics and approximation algorithms. Moreover, we study the minimum cost survivable path set problem where the cost is the number of fibers used and thus non-additive.Finally, we generalize the survivability problem to the networks with more than two layers. By applying our algorithms for survivable path set, we assess the survivability of communication networks that operate relying on power from a power grid.

show abstract

Disaster-Resilient Routing Schemes for Regional Failures

Gomes

Santos

Girão‐Silva

et al. 2020

Computer Communications and Networks

Self Cite

View full text Add to dashboard Cite

Large scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical distance value D is imposed between any intermediate element of one path and any element of the other path is presented. Next the problem of the calculation of a D-geodiverse routing solution which ensures a certain level of availability is tackled. An algorithm is described that either obtains a solution to that problem or the most available path pair satisfying the desired geographical distance value D -this can be useful for the specification of availability levels in Service Level Agreements. Finally, a case study is presented, in an optical network, to determine the cost increase in terminal equipment (transponders) of approaches to ensure a much larger separation of the paths (of the selected path pair), with respect to minimal length link-disjoint routing. An Introduction to Geographically Diverse RoutingThe occurrence of large-scale disasters such as hurricanes, tsunamis, or earthquakes may cause a number of failures with a profound effect in the telecommunication services in a * This chapter is based on work from COST Action CA15127 ("Resilient communication services protecting end-user applications from disaster-based failures -RECODIS") supported by COST (European Cooperation in Science and Technology).

show abstract

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Cited by 13 publications

References 22 publications

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

Survivable Path Sets: A New Approach to Survivability in Multilayer Networks

Disaster-Resilient Routing Schemes for Regional Failures

Contact Info

Product

Resources

About