<?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-14">
   <front>
      <title>Carrying SR-Algorithm Information in PCE-based Networks.</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="September" day="25" year="2024" />
      <abstract>
	 <t>   The SR-Algorithm associated with a Segment-ID (SID) defines the path
   computation algorithm used by Interior Gateway Protocols (IGPs).
   This information is available to controllers, such as the Path
   Computation Element (PCE), via topology learning.  This document
   proposes an approach for informing headend routers regarding the SR-
   Algorithm associated with each SID used in PCE-computed paths, as
   well as signaling a specific SR-Algorithm as a constraint to the PCE.


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