RFC 4655

A Path Computation Element (PCE)-Based Architecture, August 2006

Canonical URL:
https://www.rfc-editor.org/rfc/rfc4655.txt
File formats:
Plain TextPDF
Status:
INFORMATIONAL
Authors:
A. Farrel
J.-P. Vasseur
J. Ash
Stream:
IETF
Source:
pce (rtg)

Cite this RFC: TXT  |  XML

DOI:  10.17487/RFC4655

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

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


Abstract

Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains. This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed. This memo provides information for the Internet community.


For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 4844.


Download PDF Reader



Search RFCs
Advanced Search
×