Path Computation Element (PCE) Architecture

Document Type Replaced Internet-Draft (individual)
Last updated 2008-04-16 (latest revision 2005-02-17)
Replaced by draft-ietf-pce-architecture
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-pce-architecture
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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-layers networks is highly 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.


Adrian Farrel (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)