<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ash-pce-comm-protocol-gen-reqs" target="https://datatracker.ietf.org/doc/html/draft-ash-pce-comm-protocol-gen-reqs-01">
   <front>
      <title>PCE Communication Protocol Generic Requirements</title>
      <author initials="G." surname="Ash" fullname="Gerald Ash">
         <organization>AT&amp;T</organization>
      </author>
      <date month="May" day="3" year="2005" />
      <abstract>
	 <t>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 or multi-layer
   networks is highly complex and may require special computational
   components and cooperation between the different network domains.

   There are multiple components in the Path Computation Element (PCE)-
   based path computation model, including PCE discovery and the PCE
   communication protocol.  The PCE model is described in the &quot;PCE
   Architecture&quot; document and facilitates path computation requests from
   Path Computation Clients (PCCs) to PCEs.  This document specifies
   generic requirements for a communication protocol between PCCs and
   PCEs, and between PCEs where cooperation between PCEs is desirable.
   Subsequent documents will specify application-specific requirements
   for the PCE communication protocol.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ash-pce-comm-protocol-gen-reqs-01" />
   
</reference>
