Liaison statement
Publication of new RFC on PCE Architecture

Submission date 2006-09-08
From IETF PCE WG (Adrian Farrel)
To ITU-T SG15 Q14 (Greg Jones)
Cc Kam Lam, Dean Cheng, Stephen Trowbridge, Scott Bradner, Ross Callon, Bill Fenner, JP Vasseur, PCE mailing list
Response contact Adrian Farrel
Technical contact Adrian Farrel
Purpose For information
Attachments (None)
The PCE Working Group of the IETF is pleased to inform you of the
publication of a new RFC on the PCE architecture.

RFC 4655 is titled "A Path Computation Element (PCE)-Based

The Abstract of this RFC reads as follows:

   Constraint-based path computation is a fundamental building block
   traffic engineering systems such as Multiprotocol Label Switching
   (MPLS) and Generalized Multiprotocol Label Switching (GMPLS)
   networks.  Path computation in large, multi-domain, multi-region,
   multi-layer networks is complex and may require special
   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

The RFC can be downloaded without charge from:

We believe that this RFC will be of interest to you in your work on
G.7715.2 and we would welcome any comments or questions about this RFC
or any other issues related to PCE through our open mailing list. For
subscription information about the mailing list and other information
about the PCE working group, please visit our Web page at:

Best regards,
Adrian Farrel and JP Vasseur
PCE Working Group Co-chairs