Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling

Kini, Shrinivasa; Ramasubramanian, Srinivasan; Kvalbein, Amund; Hansen, Audun Fosselie

doi:10.1109/tnet.2010.2055887

Cited by 43 publications

(24 citation statements)

References 24 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

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: 99%

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: 99%

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

“…This is because backup configurations under 2DMRC are insensitive to link costs and have global scope. Another recently proposed scheme [7] handles dual link or single node failures, whereas LOLS approach can handle two or more independent link or node failures.…”

Section: Single or Correlated Failuresmentioning

confidence: 99%

“…Hence, it is important to devise schemes that protect the network against not only single failures but also multiple independent failures. Our work is motivated by this need, which is also the focus of some of the recently proposed routing schemes [5]- [7].…”

Section: Introductionmentioning

confidence: 99%

“…However, most of these schemes are designed to deal with single or correlated failures only. Recently, [7] proposed an approach to handle dual link, but only single node failures. On the other hand, failure carrying packets (FCP) [5] and packet recycle (PR) [6] try to forward packets to reachable destinations even in case of arbitrary number of failures.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing

Robertson

Nelakuditi

2012

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-It has been observed that transient failures are fairly common in IP backbone networks and there have been several proposals based on local rerouting to provide high network availability despite failures. While most of these proposals are effective in handling single failures, they either cause loops or drop packets in the case of multiple independent failures. To ensure forwarding continuity even with multiple failures, we propose Localized On-demand Link State (LOLS) routing. Under LOLS, each packet carries a blacklist, which is a minimal set of failed links encountered along its path, and the next hop is determined by excluding the blacklisted links. We show that the blacklist can be reset when the packet makes forward progress towards the destination and hence can be encoded in a few bits. Furthermore, blacklist-based forwarding entries at a router can be precomputed for a given set of failures requiring protection. While the LOLS approach is generic, this paper describes how it can be applied to ensure forwarding to all reachable destinations in case of any two link or node failures. Our evaluation of this failure scenario based on various real network topologies reveals that LOLS needs 6 bits in the worst case to convey the blacklist information. We argue that this overhead is acceptable considering that LOLS routing deviates from the optimal path by a small stretch only while routing around failures.

show abstract

“…The authors in [3,4] tackled the single link failure problem in the logical topology. The authors in [5] focus on the dual link failure assumption. Most of these studies are based on a common assumption that failures are independent of their locations and randomly distributed across the network, which fails to reflect several real scenarios.…”

Section: Introductionmentioning

confidence: 99%