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

The information below is for an old version of the document
Document Type Expired Internet-Draft (pce WG)
Last updated 2012-05-02 (latest revision 2011-10-30)
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Reviews
Additional URLs
- Mailing list discussion
Stream WG state WG Document
Document shepherd None
IESG IESG state Expired
Consensus Boilerplate Unknown
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
https://www.ietf.org/archive/id/draft-ietf-pce-pcep-inter-domain-p2mp-procedures-01.txt

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 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.

Authors

Quintin Zhao (quintin.zhao@huawei.com)
Dhruv Dhody (dhruv.dhody@huawei.com)
Zafar Ali (zali@cisco.com)
Siva Sivabalan (msiva@cisco.com)
Daniel King (daniel@olddog.co.uk)
Ramon Casellas (ramon.casellas@cttc.e)

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