PCE-based Computation Procedure To Compute Shortest Constrained P2MP Inter-domain Traffic Engineering Label Switched Paths
draft-zhao-pce-pcep-inter-domain-p2mp-procedures-07
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Quintin Zhao , Zafar Ali , Tarek Saad , Siva Sivabalan , Daniel King , Ramon Casellas | ||
Last updated | 2012-10-10 (Latest revision 2011-01-21) | ||
Replaced by | draft-ietf-pce-pcep-inter-domain-p2mp-procedures | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
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 | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
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.)