RFC 8751

Hierarchical Stateful Path Computation Element (PCE), March 2020

File formats:

icon for HTML icon for text file icon for v3pdf icon for XML
Status:
INFORMATIONAL
Authors:
D. Dhody
Y. Lee
D. Ceccarelli
J. Shin
D. King
Stream:
IETF
Source:
pce (rtg)

Cite this RFC: TXT  |  XML

DOI:  10.17487/RFC8751

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

Other actions: Submit Errata  |  Find IPR Disclosures from the IETF


Abstract

A stateful Path Computation Element (PCE) maintains information on the current network state received from the Path Computation Clients (PCCs), including computed Label Switched Paths (LSPs), reserved resources within the network, and pending path computation requests. This information may then be considered when computing the path for a new traffic-engineered LSP or for any associated/dependent LSPs. The path-computation response from a PCE helps the PCC to gracefully establish the computed LSP.

The Hierarchical Path Computation Element (H-PCE) architecture allows the optimum sequence of interconnected domains to be selected and network policy to be applied if applicable, via the use of a hierarchical relationship between PCEs.

Combining the capabilities of stateful PCE and the hierarchical PCE would be advantageous. This document describes general considerations and use cases for the deployment of stateful, but not stateless, PCEs using the hierarchical PCE architecture.


For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 4844.


Download PDF Reader