Fast Reroute for Node Protection in LDP-based LSPs
draft-esale-ldp-node-frr-00
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Santosh Esale , Yakov Rekhter , Raveendra Torvi , Luyuan Fang , Luay Jalil | ||
Last updated | 2015-09-25 (Latest revision 2015-03-24) | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document describes procedures to support node protection for (unicast) Label Switched Paths(LSPs) established by LDP("Label Distribution Protocol"). 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.
Authors
Santosh Esale
Yakov Rekhter
Raveendra Torvi
Luyuan Fang
Luay Jalil
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)