Sign in
Version 5.13.0, 2015-03-25
Report a bug

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

Document type: Replaced Internet-Draft (individual)
Document stream: No stream defined
Last updated: 2013-10-21
Intended RFC status: Unknown
Other versions: (expired, archived): plain text, pdf, html

Stream State:No stream defined
Document shepherd: No shepherd assigned

IESG State: Replaced by draft-ietf-rtgwg-mrt-frr-algorithm
Responsible AD: (None)
Send notices to: No addresses provided

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


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)