Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute
draft-enyedi-rtgwg-mrt-frr-algorithm-04
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Gabor Sandor Envedi , Andras Csaszar , Alia Atlas , Chris Bowers , Abishek Gopalan | ||
| Last updated | 2013-10-21 | ||
| Replaced by | draft-ietf-rtgwg-mrt-frr-algorithm | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-rtgwg-mrt-frr-algorithm | |
| 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 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 Sandor 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.)