RFC 7811 on An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)
rfc-editor@rfc-editor.org Thu, 16 June 2016 23:11 UTC
Return-Path: <wwwrun@rfc-editor.org>
X-Original-To: ietf-announce@ietfa.amsl.com
Delivered-To: ietf-announce@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id B7AFB12DD57; Thu, 16 Jun 2016 16:11:23 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -104.028
X-Spam-Level:
X-Spam-Status: No, score=-104.028 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, RCVD_IN_DNSWL_LOW=-0.7, RP_MATCHES_RCVD=-1.426, SPF_HELO_PASS=-0.001, SPF_PASS=-0.001, USER_IN_WHITELIST=-100] autolearn=ham autolearn_force=no
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 3NA7XjTwCdpp; Thu, 16 Jun 2016 16:11:21 -0700 (PDT)
Received: from rfc-editor.org (rfc-editor.org [4.31.198.49]) (using TLSv1.2 with cipher AECDH-AES256-SHA (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id EA24C12D833; Thu, 16 Jun 2016 16:11:21 -0700 (PDT)
Received: by rfc-editor.org (Postfix, from userid 30) id DF91DB80C2F; Thu, 16 Jun 2016 16:11:21 -0700 (PDT)
To: ietf-announce@ietf.org, rfc-dist@rfc-editor.org
Subject: RFC 7811 on An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)
X-PHP-Originating-Script: 1005:ams_util_lib.php
From: rfc-editor@rfc-editor.org
Message-Id: <20160616231121.DF91DB80C2F@rfc-editor.org>
Date: Thu, 16 Jun 2016 16:11:21 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/ietf-announce/0ZiAikLZo9icSMJcEEdlOEH1kHk>
Cc: rtgwg@ietf.org, rfc-editor@rfc-editor.org
X-BeenThere: ietf-announce@ietf.org
X-Mailman-Version: 2.1.17
Precedence: list
Reply-To: ietf@ietf.org
List-Id: "IETF announcement list. No discussions." <ietf-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/ietf-announce/>
List-Post: <mailto:ietf-announce@ietf.org>
List-Help: <mailto:ietf-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 16 Jun 2016 23:11:24 -0000
A new Request for Comments is now available in online RFC libraries.
RFC 7811
Title: An Algorithm for Computing IP/LDP
Fast Reroute Using Maximally Redundant Trees
(MRT-FRR)
Author: G. Enyedi,
A. Csaszar,
A. Atlas,
C. Bowers,
A. Gopalan
Status: Standards Track
Stream: IETF
Date: June 2016
Mailbox: Gabor.Sandor.Enyedi@ericsson.com,
Andras.Csaszar@ericsson.com,
akatlas@juniper.net,
cbowers@juniper.net,
abishek@ece.arizona.edu
Pages: 118
Characters: 266847
Updates/Obsoletes/SeeAlso: None
I-D Tag: draft-ietf-rtgwg-mrt-frr-algorithm-09.txt
URL: https://www.rfc-editor.org/info/rfc7811
DOI: http://dx.doi.org/10.17487/RFC7811
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.
This document is a product of the Routing Area Working Group Working Group of the IETF.
This is now a Proposed Standard.
STANDARDS TRACK: This document specifies an Internet Standards Track
protocol for the Internet community, and requests discussion and suggestions
for improvements. Please refer to the current edition of the Official
Internet Protocol Standards (https://www.rfc-editor.org/standards) for the
standardization state and status of this protocol. Distribution of this
memo is unlimited.
This announcement is sent to the IETF-Announce and rfc-dist lists.
To subscribe or unsubscribe, see
https://www.ietf.org/mailman/listinfo/ietf-announce
https://mailman.rfc-editor.org/mailman/listinfo/rfc-dist
For searching the RFC series, see https://www.rfc-editor.org/search
For downloading RFCs, see https://www.rfc-editor.org/retrieve/bulk
Requests for special distribution should be addressed to either the
author of the RFC in question, or to rfc-editor@rfc-editor.org. Unless
specifically noted otherwise on the RFC itself, all RFCs are for
unlimited distribution.
The RFC Editor Team
Association Management Solutions, LLC