<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-rtgwg-mrt-frr-architecture" target="https://datatracker.ietf.org/doc/html/draft-ietf-rtgwg-mrt-frr-architecture-07">
   <front>
      <title>An Architecture for IP/LDP Fast-Reroute Using Maximally Redundant Trees</title>
      <author initials="A." surname="Atlas" fullname="Alia Atlas">
         </author>
      <author initials="R." surname="Kebler" fullname="Robert Kebler">
         </author>
      <author initials="C." surname="Bowers" fullname="Chris Bowers">
         </author>
      <author initials="G. S." surname="Envedi" fullname="Gabor Sandor Envedi">
         </author>
      <author initials="A." surname="Csaszar" fullname="Andras Csaszar">
         </author>
      <author initials="J." surname="Tantsura" fullname="Jeff Tantsura">
         </author>
      <author initials="R." surname="White" fullname="Russ White">
         </author>
      <date month="October" day="15" year="2015" />
      <abstract>
	 <t>   With increasing deployment of Loop-Free Alternates (LFA) [RFC5286],
   it is clear that a complete solution for IP and LDP Fast-Reroute is
   required.  This specification provides that solution.  IP/LDP Fast-
   Reroute with Maximally Redundant Trees (MRT-FRR) is a technology that
   gives link-protection and node-protection with 100% coverage in any
   network topology that is still connected after the failure.

   MRT removes all need to engineer for coverage.  MRT is also extremely
   computationally efficient.  For any router in the network, the MRT
   computation is less than the LFA computation for a node with three or
   more neighbors.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-rtgwg-mrt-frr-architecture-07" />
   
</reference>
