Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute
draft-enyedi-rtgwg-mrt-frr-algorithm-04

 
Document Type Replaced Internet-Draft (individual)
Last updated 2013-10-21
Replaced by draft-ietf-rtgwg-mrt-frr-algorithm
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-rtgwg-mrt-frr-algorithm
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
https://www.ietf.org/archive/id/draft-enyedi-rtgwg-mrt-frr-algorithm-04.txt

Abstract

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.

Authors

Gabor Envedi (Gabor.Sandor.Enyedi@ericsson.com)
Andras Csaszar (Andras.Csaszar@ericsson.com)
Alia Atlas (akatlas@juniper.net)
Chris Bowers (cbowers@juniper.net)
Abishek Gopalan (abishek@ece.arizona.edu)

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