<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-pce-sid-algo" target="https://datatracker.ietf.org/doc/html/draft-ietf-pce-sid-algo-17">
   <front>
      <title>Carrying SR-Algorithm in Path Computation Element Communication Protocol (PCEP).</title>
      <author initials="S." surname="Sidor" fullname="Samuel Sidor">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="Z." surname="Rose" fullname="Zoey Rose">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="S." surname="Peng" fullname="Shaofu Peng">
         <organization>ZTE Corporation</organization>
      </author>
      <author initials="S." surname="Peng" fullname="Shuping Peng">
         <organization>Huawei Technologies</organization>
      </author>
      <author initials="A." surname="Stone" fullname="Andrew Stone">
         <organization>Nokia</organization>
      </author>
      <date month="January" day="13" year="2025" />
      <abstract>
	 <t>   This document specifies extensions to the Path Computation Element
   Communication Protocol (PCEP) to support Segment Routing (SR) with a
   focus on the use of Segment Identifiers (SIDs) and SR-Algorithms in
   Traffic Engineering (TE).  The SR-Algorithm associated with a SID
   defines the path computation algorithm used by Interior Gateway
   Protocols (IGPs).  This document proposes an approach for informing
   PCEP peers about the SR-Algorithm associated with each SID used, as
   well as signaling a specific SR-Algorithm as a constraint to the PCE.
   The mechanisms for specifying SR-Algorithm constraint is allowing
   refined path computations that meet specific operational needs, such
   as low-latency or high-bandwidth paths mostly based on operator-
   defined criteria using Flexible Algorithms.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-pce-sid-algo-17" />
   
</reference>
