Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection

Gan, Ming-Lee; Liew, Soung-Yue

doi:10.1007/s11235-011-9577-2

Cited by 4 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In shared path protection, the calculation of an adequate AP and BP can be modeled as min-sum problem with ordered dual costs, which has been shown to be NP-Complete [16,17]. Algorithms for solving the min-sum problem with asymmetric weights can be found in [18] and [19]. A more general problem, the min-sum with dual costs, is solved in [20].…”

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

“…A more general problem, the min-sum with dual costs, is solved in [20]. The algorithms in [18,19,20] are all variants of the Iterative Two Step Approach, which consists in using a k-shortest enumeration algorithm [21,22], for successively obtaining a candidate active path for which an adequate backup path is calculated. The iterative process continues until certain predefined criteria are met.…”

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

See 1 more Smart Citation

Resilient arcs and node disjointness in diverse routing

Gomes

Żotkiewicz

2014

Optical Switching and Networking

View full text Add to dashboard Cite

In multi-layer networks protection can be provided at multiple layers. Hence some links at an upper layer may be resilient because they are protected at a lower layer. We will designate as resilient arc at a given layer, an arc which has some form of protection at an underlaying layer. When path diversity is used at an upper layer, and resilient arcs are taken into account, it may not be necessary for the considered paths to be fully disjoint.We solve a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Moreover, we assume that the resulting paths cannot contain loops, and costs of shared resilient arcs are counted only once towards the objective function.In the paper we present two novel algorithms solving the above problem, and two supporting algorithms that are utilized as subroutines. We implement the proposed algorithms and compare them to an MIP approach.

show abstract

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

Resilient arcs and node disjointness in diverse routing

Gomes

Żotkiewicz

2014

Optical Switching and Networking

View full text Add to dashboard Cite

show abstract

“…This problem is also NP-complete [15]. In [18] an algorithm, designated as a þ 1 protection, is proposed for a partial bandwidth protection scheme, where a is the ratio of the protection bandwidth (of the BP) to the full bandwidth (of active path).…”

Section: Introductionmentioning

confidence: 99%

Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost

et al. 2014

View full text Add to dashboard Cite

A shared risk link group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching, using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of multiple SRLG failures a set with more than two end-to-end SRLG-disjoint paths should be used. Two heuristic, the Conflicting SRLG-Exclusion Min Sum (CoSE-MS) and the Iterative Modified Suurballes's

show abstract

Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs

Gomes

Żotkiewicz

2013

2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)

View full text Add to dashboard Cite

Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection

Cited by 4 publications

References 7 publications

Resilient arcs and node disjointness in diverse routing

Resilient arcs and node disjointness in diverse routing

Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost

Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs

Contact Info

Product

Resources

About