An Architecture for IP/LDP Fast-Reroute Using Maximally Redundant Trees
draft-atlas-rtgwg-mrt-frr-architecture-01
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Alia Atlas , Robert Kebler , Maciek Konstantynowicz , Andras Csaszar , Russ White , Mike Shand | ||
| Last updated | 2012-10-11 (Latest revision 2011-10-31) | ||
| Replaced by | RFC 7812 | ||
| 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-architecture | |
| 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
As IP and LDP Fast-Reroute are increasingly deployed, the coverage limitations of Loop-Free Alternates are seen as a problem that requires a straightforward and consistent solution for IP and LDP, for unicast and multicast. This draft describes an architecture based on redundant backup trees where a single failure can cut a point-of-local-repair from the destination only on one of the pair of redundant trees. One innovative algorithm to compute such topologies is maximally disjoint backup trees. Each router can compute its next-hops for each pair of maximally disjoint trees rooted at each node in the IGP area with computational complexity similar to that required by Dijkstra. The additional state, address and computation requirements are believed to be significantly less than the Not-Via architecture requires.
Authors
Alia Atlas
Robert Kebler
Maciek Konstantynowicz
Andras Csaszar
Russ White
Mike Shand
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)