Fast convergence with fast reroute in IP networks

Robertson, Glenn; Bedenbaugh, James; Nelakuditi, Srihari

doi:10.1109/hpsr.2010.5580263

Cited by 8 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We emphasize that this problem exists independently of the IP FRR scheme used by the network and has been addressed by several studies, e.g., [10] and [24]. Indeed, the solutions proposed in [10] and [11] may be straightforwardly combined with DisPath to prevent the occurrence of such loops.…”

Section: Loop-free Fib Updatesmentioning

confidence: 98%

“…A transient loop occurs when packets in a detour path alternate between routers in AC-and BC-states [24]. As an example, consider the network depicted in Fig.…”

Section: Loop-free Fib Updatesmentioning

confidence: 99%

“…In general, IP FRR schemes are not specifically designed to eliminate it, with SafeGuard [19] being a notable exception. Fortunately, such forwarding loops are preventable via careful timing of FIB updates [10], [11], [24], which can be combined with IP Fast Reroute without ill effects.…”

Section: A Previous Work On Ip Fast Reroutementioning

confidence: 99%

See 2 more Smart Citations

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: Loop-free Fib Updatesmentioning

confidence: 98%

“…A transient loop occurs when packets in a detour path alternate between routers in AC-and BC-states [24]. As an example, consider the network depicted in Fig.…”

Section: Loop-free Fib Updatesmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Previously proposed approaches such as ordered updates for avoiding loops during convergence only work with single failures [39]. A recently proposed scheme for fast reroute with fast convergence (FCFR) [40] is also meant for single failures but amenable for extension to multiple failures. We are currently integrating FCFR with LOLS to ensure loopfree rerouting and convergence even with multiple failures.…”

Section: Issues and Discussionmentioning

confidence: 99%

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

Robertson

Nelakuditi

2012

IEEE Trans. Netw. Serv. Manage.

Self Cite

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

“…This is why we are working on integrating Fast Convergence Fast Reroute (FCFR) technique with LOLS to ensure loop free rerouting and convergence even with multiple failures. Fast Convergence with Fast Reroute (FCFR), which employs a fast reroute scheme such as Not-Via and needs just one additional bit in the packet header with much less per-packet overhead [3].…”

Section: Introductionmentioning

confidence: 99%

Loop Free Convergence Achieved by Integrating LOLS with FCFR and Gives Lower Convergence Time than OSPF

Gaikwad¹,

Pingat²

2014

IJCA

View full text Add to dashboard Cite

The short-lived failures are reasonably common in IP networks, there are many ways with which local rerouting can be provided for high accessibility but most of them are for single link failure. Here, we are suggesting a Localized On-demand Link State (LOLS) routing to safeguard the forwarding continuity even with multiple failures restraining the propagation of failure information to just a few hops. LOLS cannot promise loop-free forwarding during route convergence and this is the motive why we are working on integrating Fast Convergence Fast Reroute (FCFR) practice with LOLS to ensure loop free rerouting and convergence even with many failures. Fast Convergence with Fast Reroute (FCFR), which uses a fast reroute design such as Not-Via and desires just one additional bit in the packet header with much less per-packet overhead. Integrating LOLS with FCFR is going to hold the excellence of LOLS of loop free forwarding and conquer downside of LOLS by ensuring loop free convergence.

show abstract

Fast convergence with fast reroute in IP networks

Cited by 8 publications

References 9 publications

Full Protection Made Easy: The DisPath IP Fast Reroute Scheme

Full Protection Made Easy: The DisPath IP Fast Reroute Scheme

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

Loop Free Convergence Achieved by Integrating LOLS with FCFR and Gives Lower Convergence Time than OSPF

Contact Info

Product

Resources

About