Browse Prior Art Database

An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR) (RFC7811)

IP.com Disclosure Number: IPCOM000246703D
Original Publication Date: 2016-Jun-01
Included in the Prior Art Database: 2016-Jun-29

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

G. Enyedi: AUTHOR [+5]

Abstract

MRT Fast Reroute requires that packets can be forwarded not only on the shortest-path tree, but also on two Maximally Redundant Trees (MRTs), referred to as the MRT-Blue and the MRT-Red. A router that experiences a local failure must also have predetermined which alternate to use. This document defines how to compute these three things for use in MRT-FRR and describes the algorithm design decisions and rationale. The algorithm is based on those presented in [MRTLinear] and expanded in [EnyediThesis]. The MRT Lowpoint algorithm is required for implementation when the Default MRT Profile is implemented.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 1% of the total text.

Internet Engineering Task Force (IETF)                         G. Enyedi Request for Comments: 7811                                    A. Csaszar Category: Standards Track                                       Ericsson ISSN: 2070-1721                                                 A. Atlas                                                                C. Bowers                                                         Juniper Networks                                                               A. Gopalan                                                    University of Arizona                                                                June 2016

              An Algorithm for Computing IP/LDP Fast Reroute                Using Maximally Redundant Trees (MRT-FRR)

Abstract

   This document supports the solution put forth in "An Architecture for    IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)"    (RFC 7812) by defining 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.

Status of This Memo

   This is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force    (IETF).  It represents the consensus of the IETF community.  It has    received public review and has been approved for publication by the    Internet Engineering Steering Group (IESG).  Further information on    Internet Standards is available in Section 2 of RFC 7841.

   Information about the current status of this document, any errata,    and how to provide feedback on it may be obtained at    http://www.rfc-editor.org/info/rfc7811.

Enyedi, et al.               Standards Track                    [Page 1]
 RFC 7811                    MRT-FRR Algorithm                  June 2016

 Copyright Notice

   Copyright (c) 2016 IETF Trust and the persons identified as the    document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal    Provisions Relating to IETF Documents    (http://trustee.ietf.org/license-info) in effect on the date of    publication of this document.  Please review these documents    carefully, as they describe your rights and restrictions with respect    to this document.  Code Components extracted from thi...