Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks

Hock, David; Hartmann, Matthias; Menth, Michael; Pióro, Michał; Tomaszewski, Artur; Zukowski, Cezary

doi:10.1007/s11235-011-9603-4

Cited by 6 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that these tunnels are provided by a simple label stack in an MPLS/LDP (Multiprotocol Label Switching/Label Distribution Protocol) [2] enabled network, which is practically relevant nowadays. However, there exist MPLS networks with RSVP-TE (Reservation Protocol-Traffic Engineering) extension, wherein IPFRR is not the only option for fast protection [39,21]. On the other hand, suppose now that node s wants to send a packet to node d , and the link (s, b) fails.…”

Section: Providing Fast Protection With Lfasmentioning

confidence: 99%

High Availability in the Future Internet

Csikor

Rétvári

Tapolcai

2013

The Future Internet

View full text Add to dashboard Cite

Abstract. With the evolution of the Internet, a huge number of realtime applications, like Voice over IP, has started to use IP as primary transmission medium. These services require high availability, which is not amongst the main features of today's heterogeneous Internet where failures occur frequently. Unfortunately, the primary fast resilience scheme implemented in IP routers, Loop-Free Alternates (LFA), usually does not provide full protection against failures. Consequently, there has been a growing interest in LFA-based network optimization methods, aimed at tuning some aspect of the underlying IP topology to maximize the ratio of failure cases covered by LFA. The main goal of this chapter is to give a comprehensive overview of LFA and survey the related LFA network optimization methods, pointing out that these optimization tools can turn LFA into an easy-to-deploy yet highly effective IP fast resilience scheme.

show abstract

Section: Providing Fast Protection With Lfasmentioning

confidence: 99%

High Availability in the Future Internet

Csikor

Rétvári

Tapolcai

2013

The Future Internet

View full text Add to dashboard Cite

show abstract

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

2013

View full text Add to dashboard Cite

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 op-

show abstract

On providing fast protection with remote loop-free alternates

Csikor

Rétvári

2015

Telecommun Syst

View full text Add to dashboard Cite

Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks

Cited by 6 publications

References 4 publications

High Availability in the Future Internet

High Availability in the Future Internet

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

On providing fast protection with remote loop-free alternates

Contact Info

Product

Resources

About