<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.enyedi-rtgwg-mrt-frr-algorithm" target="https://datatracker.ietf.org/doc/html/draft-enyedi-rtgwg-mrt-frr-algorithm-04">
   <front>
      <title>Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute</title>
      <author initials="G. S." surname="Envedi" fullname="Gabor Sandor Envedi">
         </author>
      <author initials="A." surname="Csaszar" fullname="Andras Csaszar">
         <organization>Ericsson</organization>
      </author>
      <author initials="A." surname="Atlas" fullname="Alia Atlas">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="C." surname="Bowers" fullname="Chris Bowers">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="A." surname="Gopalan" fullname="Abishek Gopalan">
         <organization>University of Arizona</organization>
      </author>
      <date month="October" day="21" year="2013" />
      <abstract>
	 <t>   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.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-enyedi-rtgwg-mrt-frr-algorithm-04" />
   
</reference>
