An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees
RFC 7811, “An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees”, is a Proposed Standard document published in June 2016 by G. Enyedi, A. Csaszar, A. Atlas, C. Bowers, A. Gopalan. The canonical text is published by the RFC Editor.
Abstract
This document supports the solution put forth in "An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)" (RFC 7812) by defining the associated MRT Lowpoint algorithm that is used in the Default MRT Profile to compute both the necessary Maximally Redundant Trees with their associated next hops and the alternates to select for MRT-FRR.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 7811 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 7810 IS-IS Traffic Engineering Metric Extensions
- RFC 7812 An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees
- RFC 7809 Calendaring Extensions to WebDAV : Time Zones by Reference
- RFC 7813 IS-IS Path Control and Reservation
- RFC 7808 Time Zone Data Distribution Service
- RFC 7814 Virtual Subnet: A BGP/MPLS IP VPN-Based Subnet Extension Solution
- RFC 7807 Problem Details for HTTP APIs
- RFC 7815 Minimal Internet Key Exchange Version 2 Initiator Implementation