Cite this RFC:TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC4655
Discuss this RFC: Send questions or comments to the mailing listpce@ietf.org
Other actions:Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 4655
Constraint-based path computation is a fundamental building block fortraffic engineering systems such as Multiprotocol Label Switching(MPLS) and Generalized Multiprotocol Label Switching (GMPLS)networks. Path computation in large, multi-domain, multi-region, ormulti-layer networks is complex and may require specialcomputational components and cooperation between the differentnetwork domains.
This document specifies the architecture for a Path ComputationElement (PCE)-based model to address this problem space. Thisdocument does not attempt to provide a detailed description of allthe architectural components, but rather it describes a set ofbuilding blocks for the PCE architecture from which solutions may beconstructed. This memo provides information for the Internet community.
For the definition ofStatus,seeRFC 2026.
For the definition ofStream, seeRFC 8729.