RFC 7334

PCE-Based Computation Procedure to Compute Shortest Constrained Point-to-Multipoint (P2MP) Inter-Domain Traffic Engineering Label Switched Paths, August 2014

File formats:
icon for text file icon for PDF icon for HTML
Status:
EXPERIMENTAL
Authors:
Q. Zhao
D. Dhody
D. King
Z. Ali
R. Casellas
Stream:
IETF
Source:
pce (rtg)

Cite this RFC: TXT  |  XML  |   BibTeX

DOI:  https://doi.org/10.17487/RFC7334

Discuss this RFC: Send questions or comments to the mailing list pce@ietf.org

Other actions: Submit Errata  |  Find IPR Disclosures from the IETF  |  View History of RFC 7334


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.


For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 8729.




Advanced Search