PCE-based Computation Procedure To Compute Shortest Constrained P2MP Inter-domain Traffic Engineering Label Switched Paths

Document Type Replaced Internet-Draft (individual)
Last updated 2012-10-10 (latest revision 2011-01-21)
Replaced by RFC 7334
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-pce-pcep-inter-domain-p2mp-procedures
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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 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 the procedures and extensions to the PCE communication Protocol (PCEP) to handle requests and responses for the computation of inter-domain paths for P2MP TE LSPs.


Quintin Zhao (qzhao@huawei.com)
Zafar Ali (zali@cisco.com)
Tarek Saad (tsaad@cisco.com)
Siva Sivabalan (msiva@cisco.com)
Daniel King (daniel@olddog.co.uk)
Ramon Casellas (ramon.casellas@cttc.es)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)