datatracker.ietf.org
Sign in
Version 5.3.0, 2014-04-12
Report a bug

Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute
draft-enyedi-rtgwg-mrt-frr-algorithm-04

Document type: Replaced Internet-Draft (individual)
Document stream: No stream defined
Last updated: 2013-10-21
Intended RFC status: Unknown
Other versions: (expired, archived): plain text, pdf, html
Stream State:No stream defined
Document shepherd: No shepherd assigned
IESG State: Replaced by draft-ietf-rtgwg-mrt-frr-algorithm
Responsible AD: (None)
Send notices to: No addresses provided
Email Authors | IPR Disclosures | References | Referenced By | Check nits | History feed | Search Mailing Lists

This Internet-Draft is no longer active. Unofficial copies of old Internet-Drafts can be found here:
http://tools.ietf.org/id/draft-enyedi-rtgwg-mrt-frr-algorithm

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 Envedi <Gabor.Sandor.Enyedi@ericsson.com>
Andras Csaszar <Andras.Csaszar@ericsson.com>
Alia Atlas <akatlas@juniper.net>
cbowers@juniper.net <cbowers@juniper.net>
Abishek Gopalan <abishek@ece.arizona.edu>

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