Skip to main content

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

The information below is for an old version of the document.
Document Type Expired Internet-Draft (pce WG)
Authors Quintin Zhao , Dhruv Dhody , Zafar Ali , Tarek Saad , Siva Sivabalan , Daniel King , Ramon Casellas
Last updated 2012-11-05 (Latest revision 2012-05-02)
Replaces draft-zhao-pce-pcep-inter-domain-p2mp-procedures, draft-zhao-pce-pcep-inter-domain-p2mp-procedures
Stream Internet Engineering Task Force (IETF)
Formats
Expired & archived
plain text htmlized pdfized bibtex
Reviews
Stream WG state WG Document
Document shepherd (None)
IESG IESG state Expired
Consensus boilerplate Unknown
Telechat date (None)
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-02.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
Dhruv Dhody
Zafar Ali
Tarek Saad
Siva Sivabalan
Daniel King
Ramon Casellas

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