An Architecture for Multicast Protection Using Maximally Redundant Trees

Document Type Expired Internet-Draft (individual)
Authors Alia Atlas  , Robert Kebler  , IJsbrand Wijnands  , Andras Csaszar  , Gabor Envedi 
Last updated 2014-01-13 (latest revision 2013-07-12)
Stream (None)
Intended RFC status (None)
Expired & archived
plain text pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
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


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.


Alia Atlas (
Robert Kebler (
IJsbrand Wijnands (
Andras Csaszar (
Gabor Envedi (

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