Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute

The information below is for an old version of the document
Document Type Expired Internet-Draft (rtgwg WG)
Authors Gabor Envedi  , Andras Csaszar  , Alia Atlas  , Chris Bowers  , Abishek Gopalan 
Last updated 2015-01-05 (latest revision 2014-07-04)
Replaces draft-enyedi-rtgwg-mrt-frr-algorithm
Stream Internet Engineering Task Force (IETF)
Expired & archived
plain text xml pdf htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


A complete solution for IP and LDP Fast-Reroute using Maximally Redundant Trees is presented in [I-D.ietf-rtgwg-mrt-frr- architecture]. This document defines 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.


Gabor Envedi (
Andras Csaszar (
Alia Atlas (
Chris Bowers (
Abishek Gopalan (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)