A Path Computation Element -Based Architecture
RFC 4655, “A Path Computation Element -Based Architecture”, is an Informational document published in August 2006 by A. Farrel, J.-P. Vasseur, J. Ash. The canonical text is published by the RFC Editor.
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.
What “Informational” means
Published for the general information of the community. It does not define an IETF standard and carries no standards-track status.
The canonical text of RFC 4655 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 4654 TCP-Friendly Multicast Congestion Control : Protocol Specification
- RFC 4656 A One-way Active Measurement Protocol
- RFC 4653 Improving the Robustness of TCP to Non-Congestion Events
- RFC 4657 Path Computation Element Communication Protocol Generic Requirements
- RFC 4652 Evaluation of Existing Routing Protocols against Automatic Switched Optical Network Routing Requirements
- RFC 4659 BGP-MPLS IP Virtual Private Network Extension for IPv6 VPN
- RFC 4650 HMAC-Authenticated Diffie-Hellman for Multimedia Internet KEYing
- RFC 4660 Functional Description of Event Notification Filtering