IP Fast Reroute for Double-Link Failure Recovery

Xi, Kang; Chao, H. Jonathan

doi:10.1109/glocom.2009.5425443

Cited by 8 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such solutions support fast recovery for all possible single component failures, and a few can even handle two simultaneous link failures [17], [35]. Nevertheless, they also cause significant side-effects that negatively impact performance: Diverted packets need additional processing that may have to take place in the router slow path, and if they exceed MTU size due to the IP tunnel header or the extra embedded information, they must be fragmented as well.…”

Section: A Previous Work On Ip Fast Reroutementioning

confidence: 97%

Full Protection Made Easy: The DisPath IP Fast Reroute Scheme

Antonakopoulos

Bejerano²,

Koppol³

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

A major concern in IP networks is to ensure that any topology changes, whether planned or unplanned, do not disrupt network performance. IP Fast Reroute (IP FRR) is a general approach to address this issue by promptly forwarding an IP packet to a predetermined alternate next-hop as soon as the primary next-hop to the destination becomes unavailable. Among the numerous IP FRR schemes proposed to date, the simplest ones do not guarantee protection against every component failure, while more sophisticated ones tend to be difficult to implement due to various inherent complexities, such as nontrivial modifications of IP packets or high resource requirements. This paper presents a simple and efficient IP FRR scheme called DisPath, which leverages several fundamental properties of minimum-cost node-disjoint paths for determining the alternate next-hop toward a given destination. We show that DisPath ensures full coverage, meaning protection against all single link or node failures, with low computational overhead and without the practical complications encountered by other schemes that offer the same level of protection. Our simulations on several realistic instances reveal that DisPath usually creates shorter (and, at worst, not much longer) alternative paths than existing solutions adopted by the industry. Combined with the aforementioned protection guarantee and simplicity of implementation, these results provide strong evidence that DisPath is a most compelling choice of IP FRR scheme.Index Terms-Disjoint paths, fast reroute, loop-free alternate (LFA), U-turn.

show abstract

Section: A Previous Work On Ip Fast Reroutementioning

confidence: 97%

Full Protection Made Easy: The DisPath IP Fast Reroute Scheme

Antonakopoulos

Bejerano²,

Koppol³

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…We distinguish between approaches that deterministically chose the outgoing port and those that do it in a probabilistic manner. Among the former ones, previous works are limited in several aspects: the proposed heuristics have no provable failover guarantees [13], [14]; failover mechanisms have limited guaranteed resilience against only one single link/node failure [15]- [20] or resiliency to ⌊ k 2 −1⌋ link failures for k-connected graphs [2]; routing focus limited to shortestpath-IP [13], [31], [32]; impossibility of achieving resiliency to any arbitrary number of link failures [16]. For specific topologies, works [35], [36] achieve resiliency to k − 1 link failures but no general methodology is described.…”

Section: Related Workmentioning

confidence: 99%

On the Resiliency of Static Forwarding Tables

Chiesa

Nikolaevskiy

Mitrović

et al. 2017

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Fast Reroute (FRR) and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-header-rewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the "connectivity" k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to 4 simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k−1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.

show abstract

“…Our work belongs to this category. Previous works are limited in several aspects: the proposed heuristics have no provable failover guarantees [14], [15]; failover mechanisms have limited guaranteed resilience against only one single link/node failure [16]- [21] or ⌊ k 2 − 1⌋resiliency for k-connected graphs [2]; routing focus limited to shortest-path-IP [14], [34], [35]; impossibility of achieving ∞-resiliency [17]. For specific topologies, works [38], [39] achieve k − 1 resiliency but no general methodology is described.…”

Section: Related Workmentioning

confidence: 99%