draft-ietf-rtgwg-mrt-frr-algorithm-08.txt   draft-ietf-rtgwg-mrt-frr-algorithm-09.txt 
Routing Area Working Group G. Enyedi Routing Area Working Group G. Enyedi
Internet-Draft A. Csaszar Internet-Draft A. Csaszar
Intended status: Standards Track Ericsson Intended status: Standards Track Ericsson
Expires: July 13, 2016 A. Atlas Expires: August 19, 2016 A. Atlas
C. Bowers C. Bowers
Juniper Networks Juniper Networks
A. Gopalan A. Gopalan
University of Arizona University of Arizona
January 10, 2016 February 16, 2016
An Algorithm for Computing Maximally Redundant Trees for IP/LDP Fast- An Algorithm for Computing Maximally Redundant Trees for IP/LDP Fast-
Reroute Reroute
draft-ietf-rtgwg-mrt-frr-algorithm-08 draft-ietf-rtgwg-mrt-frr-algorithm-09
Abstract Abstract
A solution for IP and LDP Fast-Reroute using Maximally Redundant A solution for IP and LDP Fast-Reroute using Maximally Redundant
Trees is presented in draft-ietf-rtgwg-mrt-frr-architecture. This Trees is presented in draft-ietf-rtgwg-mrt-frr-architecture. This
document defines the associated MRT Lowpoint algorithm that is used document defines the associated MRT Lowpoint algorithm that is used
in the Default MRT profile to compute both the necessary Maximally in the Default MRT profile to compute both the necessary Maximally
Redundant Trees with their associated next-hops and the alternates to Redundant Trees with their associated next-hops and the alternates to
select for MRT-FRR. select for MRT-FRR.
skipping to change at page 1, line 41 skipping to change at page 1, line 41
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on July 13, 2016. This Internet-Draft will expire on August 19, 2016.
Copyright Notice Copyright Notice
Copyright (c) 2016 IETF Trust and the persons identified as the Copyright (c) 2016 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 66, line 8 skipping to change at page 66, line 8
destination. Building a different GADAG for each destination is destination. Building a different GADAG for each destination is
computationally more expensive, but it may give somewhat shorter computationally more expensive, but it may give somewhat shorter
alternate paths. Using destination-rooted GADAGs would require a new alternate paths. Using destination-rooted GADAGs would require a new
MRT profile to be created with a new MRT algorithm specification, MRT profile to be created with a new MRT algorithm specification,
since all routers in the MRT Island would need to use destination- since all routers in the MRT Island would need to use destination-
rooted GADAGs. rooted GADAGs.
11. Acknowledgements 11. Acknowledgements
The authors would like to thank Shraddha Hegde, Eric Wu, Janos The authors would like to thank Shraddha Hegde, Eric Wu, Janos
Farkas, and Stewart Bryant for their suggestions and review. We Farkas, Stewart Bryant, and Alvaro Retana for their suggestions and
would also like to thank Anil Kumar SN for his assistance in review. We would also like to thank Anil Kumar SN for his assistance
clarifying the algorithm description and pseudo-code. in clarifying the algorithm description and pseudo-code.
12. IANA Considerations 12. IANA Considerations
This document includes no request to IANA. This document includes no request to IANA.
13. Security Considerations 13. Security Considerations
The algorithm described in this document does not introduce new The algorithm described in this document does not introduce new
security concerns beyond those already discussed in the document security concerns beyond those already discussed in the document
describing the MRT FRR architecture describing the MRT FRR architecture
 End of changes. 5 change blocks. 
7 lines changed or deleted 7 lines changed or added

This html diff was produced by rfcdiff 1.42. The latest version is available from http://tools.ietf.org/tools/rfcdiff/