An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)

Gábor Enyedi, Andras Csaszar, Alia Atlas, Caleb Bowers, Abishek Gopalan · 2016

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. Status of This Memo This is an Internet Standards Track document.This document is a product of the Internet Engineering Task Force (IETF).It represents the consensus of the IETF community.It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG).Further information on Internet Standards is available in Section 2 of RFC 7841.

Read the paper · More papers on PaperTik