RSVP Extensions For Re-optimization of Loosely Routed Point-to-Multipoint Traffic Engineering Label Switched Paths (LSPs)
draft-ietf-teas-p2mp-loose-path-reopt-09

Document Type Active Internet-Draft (teas WG)
Last updated 2017-03-22 (latest revision 2017-02-02)
Replaces draft-ietf-mpls-p2mp-loose-path-reopt
Stream IETF
Intended RFC status Proposed Standard
Formats plain text pdf html bibtex
Reviews GENART will not review this version
Stream WG state Submitted to IESG for Publication Apr 2015
Document shepherd Vishnu Beeram
Shepherd write-up Show (last changed 2016-11-06)
IESG IESG state RFC Ed Queue
Consensus Boilerplate Yes
Telechat date
Responsible AD Deborah Brungard
Send notices to "Loa Andersson" <loa@pi.nu>
IANA IANA review state Version Changed - Review Needed
IANA action state RFC-Ed-Ack
RFC Editor RFC Editor state RFC-EDITOR
TEAS Working Group                                          T. Saad, Ed.
Internet-Draft                                            R. Gandhi, Ed.
Intended status: Standards Track                                  Z. Ali
Expires: August 6, 2017                              Cisco Systems, Inc.
                                                              R. Venator
                                      Defense Information Systems Agency
                                                               Y. Kamite
                                          NTT Communications Corporation
                                                        February 2, 2017

         RSVP Extensions For Re-optimization of Loosely Routed 
  Point-to-Multipoint Traffic Engineering Label Switched Paths (LSPs)
                draft-ietf-teas-p2mp-loose-path-reopt-09

Abstract

   Re-optimization of a Point-to-Multipoint (P2MP) Traffic Engineered
   (TE) Label Switched Path (LSP) may be triggered based on the need to
   re-optimize an individual source-to-leaf (S2L) sub-LSP or a set of
   S2L sub-LSPs, both using Sub-Group-Based Re-optimization 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 re-optimization 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 re-optimizing a large number of S2L
   sub-LSPs in a tree using the Sub-Group-Based Re-optimization 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 Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
 

Saad, et al.             Expires August 6, 2017                 [Page 1]
Internet-Draft        P2MP-TE Loosely Routed LSPs       February 2, 2017

   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

Copyright Notice

   Copyright (c) 2017 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

 

Saad, et al.             Expires August 6, 2017                 [Page 2]
Internet-Draft        P2MP-TE Loosely Routed LSPs       February 2, 2017

Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  4
   2.  Conventions Used in This Document  . . . . . . . . . . . . . .  4
     2.1.  Key Word Definitions . . . . . . . . . . . . . . . . . . .  4
     2.2.  Abbreviations  . . . . . . . . . . . . . . . . . . . . . .  5
     2.3.  Terminology  . . . . . . . . . . . . . . . . . . . . . . .  5
   3.  Overview . . . . . . . . . . . . . . . . . . . . . . . . . . .  5
     3.1.  Loosely Routed Inter-domain P2MP-TE LSP Tree . . . . . . .  6
     3.2.  Existing Mechanism For Tree-Based P2MP-TE LSP 
           Re-optimization  . . . . . . . . . . . . . . . . . . . . .  6
     3.3.  Existing Mechanism For Sub-Group-Based P2MP-TE LSP
           Re-optimization  . . . . . . . . . . . . . . . . . . . . .  7
   4.  Signaling Extensions For Loosely Routed P2MP-TE LSP 
       Re-optimization  . . . . . . . . . . . . . . . . . . . . . . .  8
     4.1.  Tree-Based Re-optimization . . . . . . . . . . . . . . . .  8
     4.2.  Sub-Group-Based Re-optimization Using Fragment
           Identifier . . . . . . . . . . . . . . . . . . . . . . . .  9
   5.  Message and Object Definitions . . . . . . . . . . . . . . . . 11
     5.1.  P2MP-TE Tree Re-evaluation Request Flag  . . . . . . . . . 11
     5.2.  Preferable P2MP-TE Tree Exists Path Error Sub-code . . . . 11
Show full document text