An Architecture for Multicast Protection Using Maximally Redundant Trees
draft-atlas-rtgwg-mrt-mc-arch-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Alia Atlas , Robert Kebler , IJsbrand Wijnands , Andras Csaszar , Gabor Sandor Envedi | ||
| Last updated | 2012-09-06 (Latest revision 2012-03-05) | ||
| RFC stream | (None) | ||
| Formats | |||
| Additional resources | |||
| 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
Failure protection is desirable for multicast traffic, whether signaled via PIM or mLDP. Different mechanisms are suitable for different use-cases and deployment scenarios. This document describes the architecture for global protection (aka multicast live- live) and for local protection (aka fast-reroute). The general methods for global protection and local protection using alternate-trees are dependent upon the use of Maximally Redundant Trees. Local protection can also tunnel traffic in unicast tunnels to take advantage of the routing and fast-reroute mechanisms available for IP/LDP unicast destinations. The failures protected against are single link or node failures. While the basic architecture might support protection against shared risk group failures, algorithms to dynamically compute MRTs supporting this are for future study.
Authors
Alia Atlas
Robert Kebler
IJsbrand Wijnands
Andras Csaszar
Gabor Sandor Envedi
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)