A Forward-Search P2MP TE LSP Inter-Domain Path Computation
draft-chen-pce-forward-search-p2mp-path-02

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2011-10-30 (latest revision 2011-07-11)
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Internet Engineering Task Force                                  H. Chen
Internet-Draft                                       Huawei Technologies
Intended status: Standards Track                     O. Gonzalez de Dios
Expires: May 2, 2012                                      Telefonica I+D
                                                        October 30, 2011

       A Forward-Search P2MP TE LSP Inter-Domain Path Computation
             draft-chen-pce-forward-search-p2mp-path-02.txt

Abstract

   This document presents a forward search procedure for computing a
   path for a Point-to-MultiPoint (P2MP) Traffic Engineering (TE) Label
   Switched Path (LSP) acrossing a number of domains through using
   multiple Path Computation Elements (PCEs).  In addition, extensions
   to the Path Computation Element Communication Protocol (PCEP) for
   supporting the forward search procedure are described.

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
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on May 2, 2012.

Copyright Notice

   Copyright (c) 2011 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

Chen & Gonzalez de Dios    Expires May 2, 2012                  [Page 1]
Internet-Draft          Forward Search P2MP Path            October 2011

   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  3
   2.  Terminology  . . . . . . . . . . . . . . . . . . . . . . . . .  3
   3.  Conventions Used in This Document  . . . . . . . . . . . . . .  4
   4.  Requirements . . . . . . . . . . . . . . . . . . . . . . . . .  4
   5.  Forward Search P2MP Path Computation . . . . . . . . . . . . .  5
     5.1.  Overview of Procedure  . . . . . . . . . . . . . . . . . .  5
     5.2.  Description of Procedure . . . . . . . . . . . . . . . . .  6
     5.3.  Comparing to BRPC  . . . . . . . . . . . . . . . . . . . .  8
   6.  Extensions to PCEP . . . . . . . . . . . . . . . . . . . . . .  8
     6.1.  RP Object Extension  . . . . . . . . . . . . . . . . . . .  9
     6.2.  PCE Object . . . . . . . . . . . . . . . . . . . . . . . .  9
     6.3.  Candidate Node List Object . . . . . . . . . . . . . . . . 10
     6.4.  Node Flags Object  . . . . . . . . . . . . . . . . . . . . 11
     6.5.  Rest Destination Nodes Object  . . . . . . . . . . . . . . 11
     6.6.  Request Message Extension  . . . . . . . . . . . . . . . . 12
   7.  Security  Considerations . . . . . . . . . . . . . . . . . . . 13
   8.  IANA Considerations  . . . . . . . . . . . . . . . . . . . . . 14
     8.1.  Request Parameter Bit Flags  . . . . . . . . . . . . . . . 14
   9.  Acknowledgement  . . . . . . . . . . . . . . . . . . . . . . . 14
   10. References . . . . . . . . . . . . . . . . . . . . . . . . . . 14
     10.1. Normative References . . . . . . . . . . . . . . . . . . . 14
     10.2. Informative References . . . . . . . . . . . . . . . . . . 15
   Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 15

Chen & Gonzalez de Dios    Expires May 2, 2012                  [Page 2]
Internet-Draft          Forward Search P2MP Path            October 2011

1.  Introduction

   RFC 4105 "Requirements for Inter-Area MPLS TE" lists the requirements
   for computing a shortest path for a TE LSP acrossing multiple IGP
   areas; and RFC 4216 "MPLS Inter-Autonomous System (AS) TE
   Requirements" describes the requirements for computing a shortest
   path for a TE LSP acrossing multiple ASes.  RFC 5671 "Applicability
   of PCE to P2MP MPLS and GMPLS TE" examines the applicability of PCE
   to path computation for P2MP TE LSPs in MPLS and GMPLS networks.

   This document presents a forward search procedure to address these
Show full document text