PCE-Based Computation Procedure to Compute Shortest Constrained Point-to-Multipoint Inter-Domain Traffic Engineering Label Switched Paths
RFC 7334, “PCE-Based Computation Procedure to Compute Shortest Constrained Point-to-Multipoint Inter-Domain Traffic Engineering Label Switched Paths”, is an Experimental document published in August 2014 by Q. Zhao, D. Dhody, D. King, Z. Ali, R. Casellas. The canonical text is published by the RFC Editor.
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.
What “Experimental” means
Describes a specification that is part of a research or development effort, published so the community can gain experience with it.
The canonical text of RFC 7334 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 7333 Requirements for Distributed Mobility Management
- RFC 7335 IPv4 Service Continuity Prefix
- RFC 7332 Loop Detection Mechanisms for Session Initiation Protocol Back-to-Back User Agents
- RFC 7336 Framework for Content Distribution Network Interconnection
- RFC 7331 Bidirectional Forwarding Detection Management Information Base
- RFC 7337 Content Distribution Network Interconnection Requirements
- RFC 7330 Definitions of Textual Conventions for Bidirectional Forwarding Detection Management
- RFC 7338 Requirements and Framework for Point-to-Multipoint Pseudowires over MPLS Packet Switched Networks