Browse Prior Art Database

RSVP Extensions for Reoptimization of Loosely Routed Point-to-Multipoint Traffic Engineering Label Switched Paths (LSPs) (RFC8149) Disclosure Number: IPCOM000249862D
Original Publication Date: 2017-Apr-01
Included in the Prior Art Database: 2017-Apr-20
Document File: 34 page(s) / 38K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

T. Saad: AUTHOR [+6]


node that identifies more than one node. This is often the case with inter-domain P2MP-TE LSPs where a Path Computation Element (PCE) is not used [RFC5440].

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 7% of the total text.

Internet Engineering Task Force (IETF)                      T. Saad, Ed. Request for Comments: 8149                                R. Gandhi, Ed. Category: Standards Track                                         Z. Ali ISSN: 2070-1721                                      Cisco Systems, Inc.                                                               R. Venator                                       Defense Information Systems Agency                                                                Y. Kamite                                           NTT Communications Corporation                                                               April 2017

           RSVP Extensions for Reoptimization of Loosely Routed   Point-to-Multipoint Traffic Engineering Label Switched Paths (LSPs)


   The reoptimization of a Point-to-Multipoint (P2MP) Traffic    Engineering (TE) Label Switched Path (LSP) may be triggered based on    the need to reoptimize an individual source-to-leaf (S2L) sub-LSP or    a set of S2L sub-LSPs, both using the Sub-Group-based reoptimization    method, or the entire P2MP-TE LSP tree using the Make-Before-Break    (MBB) method.  This document discusses the application of the    existing mechanisms for path reoptimization of loosely routed Point-    to-Point (P2P) TE LSPs to the P2MP-TE LSPs, identifies issues in    doing so, and defines procedures to address them.  When reoptimizing    a large number of S2L sub-LSPs in a tree using the Sub-Group-based    reoptimization method, the S2L sub-LSP descriptor list may need to be    semantically fragmented.  This document defines the notion of a    fragment identifier to help recipient nodes unambiguously reconstruct    the fragmented S2L sub-LSP descriptor list.

Status of This Memo

   This is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force    (IETF).  It represents the consensus of the IETF community.  It has    received public review and has been approved for publication by the    Internet Engineering Steering Group (IESG).  Further information on    Internet Standards is available in Section 2 of RFC 7841.

   Information about the current status of this document, any errata,    and how to provide feedback on it may be obtained at

Saad, et al.                 Standards Track                    [Page 1]
 RFC 8149               P2MP-TE Loosely Routed LSPs    ...