Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates

Máté Nagy, J. Tapolcai, Gábor Rétvári

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Lately, demand for fast failure recovery in IP networks has become compelling. The Loop-Free Alternates (LFA) specification is a simple IP Fast ReRoute (IPFRR) scheme proposed by the IETF that does not require profound changes to the network infrastructure before deployment. However, this simplicity comes at a severe price, because LFA does not provide complete protection for all possible failure cases in a general topology. This is even more so if network components are prone to fail jointly. In this paper, we study an important network optimization problem arising in this context, the so called LFA graph extension problem, which asks for augmenting the topology with new links in an attempt to improve the LFA failure case coverage. Unfortunately, this problem is NP-complete. The main contributions of the paper are a novel extension of the bipartite graph model for the LFA graph extension problem to the multiple-failure case using the model of Shared Risk Groups, and a suite of accompanying heuristics to obtain approximate solutions. We also compare the performance of the algorithms in extensive numerical studies and we conclude that the optimum can be approximated well in most cases relevant to practice.

Original languageEnglish
Pages (from-to)103-119
Number of pages17
JournalTelecommunication Systems
Volume56
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Topology
Network components
Computational complexity
Specifications
Recovery

Keywords

  • Heuristics
  • IP Fast ReRoute
  • Link and node protection
  • Loop-Free Alternates

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates. / Nagy, Máté; Tapolcai, J.; Rétvári, Gábor.

In: Telecommunication Systems, Vol. 56, No. 1, 2014, p. 103-119.

Research output: Contribution to journalArticle

@article{722e1b32a60d4f9da18b4bbc2de64a9c,
title = "Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates",
abstract = "Lately, demand for fast failure recovery in IP networks has become compelling. The Loop-Free Alternates (LFA) specification is a simple IP Fast ReRoute (IPFRR) scheme proposed by the IETF that does not require profound changes to the network infrastructure before deployment. However, this simplicity comes at a severe price, because LFA does not provide complete protection for all possible failure cases in a general topology. This is even more so if network components are prone to fail jointly. In this paper, we study an important network optimization problem arising in this context, the so called LFA graph extension problem, which asks for augmenting the topology with new links in an attempt to improve the LFA failure case coverage. Unfortunately, this problem is NP-complete. The main contributions of the paper are a novel extension of the bipartite graph model for the LFA graph extension problem to the multiple-failure case using the model of Shared Risk Groups, and a suite of accompanying heuristics to obtain approximate solutions. We also compare the performance of the algorithms in extensive numerical studies and we conclude that the optimum can be approximated well in most cases relevant to practice.",
keywords = "Heuristics, IP Fast ReRoute, Link and node protection, Loop-Free Alternates",
author = "M{\'a}t{\'e} Nagy and J. Tapolcai and G{\'a}bor R{\'e}tv{\'a}ri",
year = "2014",
doi = "10.1007/s11235-013-9822-y",
language = "English",
volume = "56",
pages = "103--119",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates

AU - Nagy, Máté

AU - Tapolcai, J.

AU - Rétvári, Gábor

PY - 2014

Y1 - 2014

N2 - Lately, demand for fast failure recovery in IP networks has become compelling. The Loop-Free Alternates (LFA) specification is a simple IP Fast ReRoute (IPFRR) scheme proposed by the IETF that does not require profound changes to the network infrastructure before deployment. However, this simplicity comes at a severe price, because LFA does not provide complete protection for all possible failure cases in a general topology. This is even more so if network components are prone to fail jointly. In this paper, we study an important network optimization problem arising in this context, the so called LFA graph extension problem, which asks for augmenting the topology with new links in an attempt to improve the LFA failure case coverage. Unfortunately, this problem is NP-complete. The main contributions of the paper are a novel extension of the bipartite graph model for the LFA graph extension problem to the multiple-failure case using the model of Shared Risk Groups, and a suite of accompanying heuristics to obtain approximate solutions. We also compare the performance of the algorithms in extensive numerical studies and we conclude that the optimum can be approximated well in most cases relevant to practice.

AB - Lately, demand for fast failure recovery in IP networks has become compelling. The Loop-Free Alternates (LFA) specification is a simple IP Fast ReRoute (IPFRR) scheme proposed by the IETF that does not require profound changes to the network infrastructure before deployment. However, this simplicity comes at a severe price, because LFA does not provide complete protection for all possible failure cases in a general topology. This is even more so if network components are prone to fail jointly. In this paper, we study an important network optimization problem arising in this context, the so called LFA graph extension problem, which asks for augmenting the topology with new links in an attempt to improve the LFA failure case coverage. Unfortunately, this problem is NP-complete. The main contributions of the paper are a novel extension of the bipartite graph model for the LFA graph extension problem to the multiple-failure case using the model of Shared Risk Groups, and a suite of accompanying heuristics to obtain approximate solutions. We also compare the performance of the algorithms in extensive numerical studies and we conclude that the optimum can be approximated well in most cases relevant to practice.

KW - Heuristics

KW - IP Fast ReRoute

KW - Link and node protection

KW - Loop-Free Alternates

UR - http://www.scopus.com/inward/record.url?scp=84902162769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902162769&partnerID=8YFLogxK

U2 - 10.1007/s11235-013-9822-y

DO - 10.1007/s11235-013-9822-y

M3 - Article

AN - SCOPUS:84902162769

VL - 56

SP - 103

EP - 119

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 1

ER -