Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks

Laborczi, Péter; Cinkler, Tibor

doi:10.1109/netwks.2004.240884

Cited by 7 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even this simplified problem is NP-hard [24] and a number of different heuristics are suggested to find good, but not necessarily optimal solutions to the problem. This line of research is continued in [23]. It should be emphasized that the cost model for backup paths used in [23,24] is approximate.…”

Section: Rrobmentioning

confidence: 99%

See 1 more Smart Citation

Optimal routing with failure‐independent path protection

et al. 2009

View full text Add to dashboard Cite

Reliable communication has become crucial in today's information society. Modern communication networks are required to deliver reliable communication to their customers. Unfortunately, protection against network failures significantly hampers efficient utilization of network investments, because the associated routing problems become much harder. In this article we present a rigorous mathematical analysis of one of the most promising protection methods: Failure independent path protection. We present an LP model which is solved by column generation. The subproblem is proven to be strongly NP -hard, but still solvable for medium sized networks through the use of specialized dynamic programming algorithms. This enables us to evaluate the performance of failure independent path protection for eight networks with up to 37 nodes and 57 links. The results indicate that only between 3% and 8% extra network capacity is necessary when compared with the capacity required by complete rerouting (which is the absolute lower bound for single link failure protection).

show abstract

Section: Rrobmentioning

confidence: 99%

“…This line of research is continued in [23]. It should be emphasized that the cost model for backup paths used in [23,24] is approximate. We quantify the exact relationship between costs for primary and backup paths in Section 3.1 and prove that the resulting optimization problem is strongly NP-hard.…”

Section: Rrobmentioning

confidence: 99%

Optimal routing with failure‐independent path protection

et al. 2009

View full text Add to dashboard Cite

show abstract

“…In Fig. 9 results are shown for all values of n and m but only for ranges ( [1,10] Also one should note that DP2LC does not enter cycle 5 if the first path identified in both procedures is optimal. An analysis of the frequency of this event was also made, and it was verified that it increased with the ratio m/n, and was practically insensitive to the range of the cost of the arcs and also to the network dimension.…”

Section: Low Density Networkmentioning

confidence: 99%

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

Gomes

Craveirinha

Jorge

2009

Computers & Operations Research

View full text Add to dashboard Cite

Routing optimisation in some types of networks requires the calculation of the minimal cost pair of disjoint paths such that the cost functions associated with the arcs in the two paths are different. An exact algorithm for solving this NP-complete problem is proposed, based on a condition which guarantees that the optimal path pair cost has been obtained. This optimality condition is based on the calculation of upper and lower bounds on the optimal cost. A formal proof of the correctness of the algorithm is described. Extensive experimentation is presented to show the effectiveness of the algorithm, including a comparison with an integer linear programming formulation.

show abstract

“…Todimala and Ramamurthy [4] proposed an iterative heuristic, based on a modification of Suurballe's algorithm [5], [6], for diverse routing under SRLG constraints that computes the least cost SRLG diverse paths pair. In [7] the same authors propose a heuristic for solving the problem of computing optimal SRLG/link diverse paths under shared protection (considering the definition of an optimal SRLG diverse path pair under shared protection as asymmetrically-weighted [8]). In [9], [10] the authors consider the problem of path protection in wavelength-routed networks with SRLG and pro-pose a heuristic method, which they compare with the trap avoidance (TA) algorithm [11].…”

Section: Introductionmentioning

confidence: 99%

An Algorithm for Enumerating SRLG Diverse Path Pairs

Gomes,

Craveirinha

2010

JTIT

View full text Add to dashboard Cite

Telecommunication networks are intrinsically multi-layered, a single failure at a lower level usually corresponds to a multi-failure scenario at an upper layer. In this context, the concept of shared risk link group (SRLG) allows an upper layer to select, for a given active path (AP), a backup path (BP), which avoids every SRLG that may involve the selected AP, in the event of a failure. That is a SRLG diversepath set maybe defined as a set of paths, between an origin and a destination, such that no pair of paths can be simultaneously affected by any given failure (or risk) in a single failure scenario. Firstly we present the formulation of the SRLG di- verse path pair calculation problem in a directed network. An algorithm for enumerating SRLG diverse paths, by non decreasing cost of their total (additive) cost will be presented, which is based on an algorithm proposed for generating minimal cost node disjoint path pairs. The SRLG diverse path pairs may be node or arc disjoint, with or without length constraints. Computational results will be presented to show the efficiency of the proposed algorithm for obtaining node or arc disjoint SRLG diverse path pairs in undirected networks.

show abstract

Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks

Cited by 7 publications

References 13 publications

Optimal routing with failure‐independent path protection

Optimal routing with failure‐independent path protection

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

An Algorithm for Enumerating SRLG Diverse Path Pairs

Contact Info

Product

Resources

About