LDP Extensions to Support Maximally Redundant Trees

Tantsura, Jeff; Hegde, Shraddha; Li, Zhenbin; Atlas, Alia; Bowers, Chris

doi:10.17487/rfc8320

Cited by 3 publications

(12 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], [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%

“…The authors in [213] are able to show that per each physical router at most 4 virtual router instances in the worst case, and at most 2 instances in the average case, suffice to reach 100% failure case coverage. Independent/redundant trees are a class of IPFRR methods based on the fault isolation technique that restrict the backup overlays to be trees [145]- [147], [199], [204], [217]- [220].…”

Section: Overlay-based Reroutementioning

confidence: 99%

“…Thanks to the simplicity of this approach, there are many versions, extensions, and even standards that use independent/ redundant trees for IPFRR [145], [146], [171], [192]- [194], [204], [217]- [220]. The underlying mathematical notions, revolving around red-blue trees, ST-numberings, and independent trees, and the conditions under which they exist, are generally well-understood [171], [194], [221].…”

Section: Overlay-based Reroutementioning

confidence: 99%

“…The earliest proposal to use redundant trees for IPFRR is Lightweight Not-via [192], [193], whereby packets are pinned into the proper (red or blue) overlay tree using notvia addresses. After multiple modifications, this proposal, and the related concept of maximally redundant trees for non-2-connected topologies, reached RFC status and became the MRT-FRR standard [145], [146], [217]. Recently, [171] proposes various heuristics to cut down the length of the resultant paths and [222] compares the performance of MRT-FRR to that of not-via addresses.…”

Section: Overlay-based Reroutementioning

confidence: 99%

See 3 more Smart Citations

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

Section: Discussionmentioning

confidence: 99%

Section: Overlay-based Reroutementioning

confidence: 99%

Section: Overlay-based Reroutementioning

confidence: 99%

Section: Overlay-based Reroutementioning

confidence: 99%

See 2 more Smart Citations

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

show abstract

“…The authors in [221] are able to show that per each physical router at most 4 virtual router instances in the worst case, and at most 2 instances in the average case, suffice to reach 100% failure case coverage. Independent/redundant trees are a class of IPFRR methods based on the fault isolation technique that restrict the backup overlays to be trees [154]- [156], [207], [225]- [228].…”

Section: Overlay-based 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

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

Fast Recovery Mechanisms in the Data Plane

Chiesa¹,

Kamisiński²,

Rak³

et al. 2020

Preprint

View full text Add to dashboard Cite

<div>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 tutorial presents a systematic 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 dataplanes. 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</div><div>questions.</div>

show abstract

LDP Extensions to Support Maximally Redundant Trees

Cited by 3 publications

References 0 publications

A Survey of Fast Recovery Mechanisms in the Data Plane

A Survey of Fast Recovery Mechanisms in the Data Plane

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

Fast Recovery Mechanisms in the Data Plane

Contact Info

Product

Resources

About