Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute
draft-enyedi-rtgwg-mrt-frr-algorithm-02
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
---|---|---|---|
Authors | Alia Atlas , Gabor Sandor Envedi , Andras Csaszar , Abishek Gopalan | ||
Last updated | 2013-04-24 (Latest revision 2012-10-21) | ||
Replaced by | draft-ietf-rtgwg-mrt-frr-algorithm, draft-ietf-rtgwg-mrt-frr-algorithm, draft-ietf-rtgwg-mrt-frr-algorithm, RFC 7811 | ||
RFC stream | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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 describes an algorithm that can be used to compute the necessary Maximally Redundant Trees and the associated next-hops.
Authors
Alia Atlas
Gabor Sandor Envedi
Andras Csaszar
Abishek Gopalan
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)