datatracker.ietf.org
Sign in
Version 5.6.2.p2, 2014-07-24
Report a bug

PCE-based Computation Procedure To Compute Shortest Constrained P2MP Inter-domain Traffic Engineering Label Switched Paths
draft-ietf-pce-pcep-inter-domain-p2mp-procedures-08

Document type: Active Internet-Draft (pce WG)
Document stream: IETF
Last updated: 2014-06-24 (latest revision 2014-06-17)
Intended RFC status: Experimental
Other versions: plain text, pdf, html

IETF State: Submitted to IESG for Publication
Consensus: Yes
Document shepherd: Julien Meuric
Shepherd Write-Up: Last changed 2013-09-24

IESG State: RFC Ed Queue
IANA Action State: RFC-Ed-Ack
RFC Editor State: RFC-EDITOR
Responsible AD: Adrian Farrel
Send notices to: pce-chairs@tools.ietf.org, draft-ietf-pce-pcep-inter-domain-p2mp-procedures@tools.ietf.org

PCE Working Group                                                Q. Zhao
Internet-Draft                                                  D. Dhody
Intended status: Experimental                          Huawei Technology
Expires: December 17, 2014                                       D. King
                                                      Old Dog Consulting
                                                                  Z. Ali
                                                           Cisco Systems
                                                             R. Casellas
                                                                    CTTC
                                                           June 17, 2014

  PCE-based Computation Procedure To Compute Shortest Constrained P2MP
         Inter-domain Traffic Engineering Label Switched Paths
          draft-ietf-pce-pcep-inter-domain-p2mp-procedures-08

Abstract

   The ability to compute paths for constrained point-to-multipoint 
   (P2MP) Traffic Engineering Label Switched Paths (TE LSPs) across
   multiple domains has been identified as a key requirement for the
   deployment of P2MP services in MPLS and GMPLS-controlled networks. 
   The Path Computation Element (PCE) has been recognized as an 
   appropriate technology for the determination of inter-domain paths of
   P2MP TE LSPs.

   This document describes an experiment to provide procedures and 
   extensions to the PCE communication Protocol (PCEP) for the 
   computation of inter-domain paths for P2MP TE LSPs.

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 December 17, 2014.

Copyright Notice

Zhao, et al.          Expires December 17, 2014                [Page 1]

Internet-Draft     PCEP P2MP Inter-Domain Procedures          June 2014

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

Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .2
     1.1.  Scope  . . . . . . . . . . . . . . . . . . . . . . . . . .2
     1.2.  Requirements Language  . . . . . . . . . . . . . . . . . .2
   2.  Terminology  . . . . . . . . . . . . . . . . . . . . . . . . .2
   3.  Examination of Existing Mechanisms  . . . . . .  . . . . . . .3
   4.  Assumptions  . . . . . . . . . . . . . . . . . . . . . . . . .5
   5.  Requirements . . . . . . . . . . . . . . . . . . . . . . . . .5
   6.  Objective Functions and Constraints. . . . . . . . . . . . . .7
   7.  P2MP Path Computation Procedures . . . . . . . . . . . . . . .8
     7.1.  General  . . . . . . . . . . . . . . . . . . . . . . . . .8
     7.2.  Core-Trees . . . . . . . . . . . . . . . . . . . . . . . .9
     7.3.  Optimal Core-Tree Computation Procedure. . . . . . . . . .12
     7.4.  Sub-tree Computation Procedures  . . . . . . . . . . . . .13
     7.5.  PCEP Protocol Extensions . . . . . . . . . . . . . . . . .13
       7.5.1.  The Extension of RP Object . . . . . . . . . . . . . .13
       7.5.2.  Domain and PCE Sequence  . . . . . . . . . . . . . . .14
     7.6.  Relationship with Hierarchical PCE . . . . . . . . . . . .14
     7.7.  Parallelism  . . . . . . . . . . . . . . . . . . . . . . .15
   8.  Protection . . . . . . . . . . . . . . . . . . . . . . . . . .15
     8.1.  End-to-end Protection  . . . . . . . . . . . . . . . . . .15
     8.2.  Domain Protection  . . . . . . . . . . . . . . . . . . . .15
   9.  Manageability Considerations . . . . . . . . . . . . . . . . .16
     9.1.  Control of Function and Policy . . . . . . . . . . . . . .16
     9.2.  Information and Data Models  . . . . . . . . . . . . . . .16
     9.3.  Liveness Detection and Monitoring  . . . . . . . . . . . .16

[include full document text]