<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.esale-ldp-node-frr" target="https://datatracker.ietf.org/doc/html/draft-esale-ldp-node-frr-00">
   <front>
      <title>Fast Reroute for Node Protection in LDP-based LSPs</title>
      <author initials="S." surname="Esale" fullname="Santosh Esale">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="Y." surname="Rekhter" fullname="Yakov Rekhter">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="R." surname="Torvi" fullname="Raveendra Torvi">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="L." surname="Fang" fullname="Luyuan Fang">
         <organization>Microsoft</organization>
      </author>
      <author initials="L." surname="Jalil" fullname="Luay Jalil">
         <organization>Verizon</organization>
      </author>
      <date month="March" day="24" year="2015" />
      <abstract>
	 <t>   This document describes procedures to support node protection for
   (unicast) Label Switched Paths(LSPs) established by LDP(&quot;Label
   Distribution Protocol&quot;). In order to protect a node N, the Point of
   Local Repair (PLR) of N must discover the Merge Points(MPTs) of node
   N such that traffic can be redirected to them in case node N fails.
   Redirecting the traffic around the failed node N depends on existing
   point-to-point LSPs originated from the PLR to the MPTs while
   bypassing the protected node N.  The procedures described in this
   document are topology independent in a sense that they provide node
   protection in any topology.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-esale-ldp-node-frr-00" />
   
</reference>
