<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-lsr-flex-algo" target="https://datatracker.ietf.org/doc/html/draft-ietf-lsr-flex-algo-26">
   <front>
      <title>IGP Flexible Algorithm</title>
      <author initials="P." surname="Psenak" fullname="Peter Psenak">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="S." surname="Hegde" fullname="Shraddha Hegde">
         <organization>Juniper Networks, Inc.</organization>
      </author>
      <author initials="C." surname="Filsfils" fullname="Clarence Filsfils">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="K." surname="Talaulikar" fullname="Ketan Talaulikar">
         <organization>Cisco Systems, Inc</organization>
      </author>
      <author initials="A." surname="Gulko" fullname="Arkadiy Gulko">
         <organization>Edward Jones</organization>
      </author>
      <date month="October" day="17" year="2022" />
      <abstract>
	 <t>IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links.  Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path.  This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network.  This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-lsr-flex-algo-26" />
   
</reference>
