Path Computation Element Communication Protocol Extensions for Establishing Relationships between Sets of Label Switched Paths
RFC 8697, “Path Computation Element Communication Protocol Extensions for Establishing Relationships between Sets of Label Switched Paths”, is a Proposed Standard document published in January 2020 by I. Minei, E. Crabbe, S. Sivabalan, H. Ananthakrishnan, D. Dhody, Y. Tanaka. It has since been updated by RFC 9756. The canonical text is published by the RFC Editor.
Abstract
This document introduces a generic mechanism to create a grouping of Label Switched Paths (LSPs) in the context of a Path Computation Element (PCE). This grouping can then be used to define associations between sets of LSPs or between a set of LSPs and a set of attributes (such as configuration parameters or behaviors), and it is equally applicable to the stateful PCE (active and passive modes) and the stateless PCE.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 8697 is hosted at rfc-editor.org. Available in HTML,TXT,PDF,XML.
- RFC 8698 Network-Assisted Dynamic Adaptation : A Unified Congestion Control Scheme for Real-Time Media
- RFC 8695 A YANG Data Model for the Routing Information Protocol
- RFC 8699 Coupled Congestion Control for RTP Media
- RFC 8693 OAuth 2.0 Token Exchange
- RFC 8701 Applying Generate Random Extensions And Sustain Extensibility to TLS Extensibility
- RFC 8702 Use of the SHAKE One-Way Hash Functions in the Cryptographic Message Syntax
- RFC 8703 Dynamic Link Exchange Protocol Link Identifier Extension
- RFC 8704 Enhanced Feasible-Path Unicast Reverse Path Forwarding