Micro-loop Prevention by Introducing a Local Convergence Delay

François, Pierre; Litkowski, Stephane; Filsfils, Clarence; Decraene, Bruno

doi:10.17487/rfc8333

Cited by 7 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general, fast IP failure recovery in the intra-domain unicast setting is a well-understood problem area, with several well-established standards [32], [130], [150], [154], [155], [169], [178], [190], [225], inter-operable implementations in off-the-shelf routers [181]- [183], [231], operational experience [180], [203], and extensive research literature [173], [184] available. Open problems remain, however: even after several iterations it is still not entirely clear how to reliably avoid intermittent micro-loops without slowing down re-convergence [190] and provide the required quality of service even during routing transients [152], [153].…”

Section: Discussionmentioning

confidence: 99%

“…Correspondingly, various optimization methods are available in the literature to improve failure-case coverage in operational networks [184]- [189]. Third, LFA is prone to forming transient "microloops" during recovery, caused by certain routers still using the "normal" routes while others already switching to the recovery routes [32], [190], and possibly "LFA loops" as well that may show up after all routers have switched. For instance, using a link-protecting LFA to protect a node failure may generate an LFA loop that will persist until the IGP finishes full reconvergence in the background [32], [191], [192].…”

Section: B Shortest-path Fast Reroutementioning

confidence: 99%

See 1 more Smart Citation

A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks

Chiesa

Kamisiński

Rak

et al. 2021

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

In order to meet their stringent dependability requirements, most modern packet-switched communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art, summarize the main lessons learned, and propose a few concrete future directions.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: B Shortest-path Fast Reroutementioning

confidence: 99%

A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks

Chiesa

Kamisiński

Rak

et al. 2021

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…In general, fast IP failure recovery in the intra-domain unicast setting is a well-understood problem area, with several well-established standards [32], [124], [141], [145], [146], [160], [170], [182], [217], inter-operable implementations in off-the-shelf routers [173]- [175], [223], operational experience [172], [195], and extensive research literature [165], [176] available. Open problems remain, however: even after several iterations it is still not entirely clear how to reliably avoid intermittent micro-loops without slowing down re-convergence [182] and provide the required quality of service even during routing transients [143], [144].…”

Section: Discussionmentioning

confidence: 99%

“…Second, LFA does not guarantee full failure coverage: depending on the topology and link costs LFA can protect about 80% of single link failures . Third, LFA is prone to forming transient "microloops" during recovery, caused by certain routers still using the "normal" routes while others already switching to the recovery routes [32], [182], and possibly "LFA loops" as well that may show up after all routers have switched. For instance, using a link-protecting LFA to protect a node failure may generate an LFA loop that will persist until the IGP finishes full reconvergence in the background [32], [183], [184].…”

Section: B Shortest-path Fast Reroutementioning

confidence: 99%

A Survey of Fast Recovery Mechanisms in the Data Plane

Chiesa¹,

Kamisiński²,

Rak³

et al. 2020

Preprint

View full text Add to dashboard Cite

In order to meet their stringent dependability requirements, most modern communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art and compile open research questions.<br>

show abstract

“…[RFC6976] has not been widely implemented, presumably due to the complexity of the technique. [RFC8333] has been implemented. However, it does not prevent all micro-loops that can occur for a given topology and failure scenario.…”

Section: Specifications Like Is-is ([Rfc1195]mentioning

confidence: 99%