<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-lsr-flex-algo-bw-con" target="https://datatracker.ietf.org/doc/html/draft-ietf-lsr-flex-algo-bw-con-17">
   <front>
      <title>Flexible Algorithms: Bandwidth, Delay, Metrics and Constraints</title>
      <author initials="S." surname="Hegde" fullname="Shraddha Hegde">
         <organization>Juniper Networks Inc.</organization>
      </author>
      <author initials="W." surname="Britto" fullname="William Britto">
         <organization>Juniper Networks Inc.</organization>
      </author>
      <author initials="R." surname="Shetty" fullname="Rajesh Shetty">
         <organization>Juniper Networks Inc.</organization>
      </author>
      <author initials="B." surname="Decraene" fullname="Bruno Decraene">
         <organization>Orange</organization>
      </author>
      <author initials="P." surname="Psenak" fullname="Peter Psenak">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="T." surname="Li" fullname="Tony Li">
         <organization>Juniper Networks Inc.</organization>
      </author>
      <date month="December" day="4" year="2024" />
      <abstract>
	 <t>   Many networks configure the link metric relative to the link
   capacity.  High bandwidth traffic gets routed as per the link
   capacity.  Flexible algorithms provide mechanisms to create
   constraint based paths in an IGP.  This draft documents a generic
   metric type and set of bandwidth related constraints to be used in
   Flexible Algorithms.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-lsr-flex-algo-bw-con-17" />
   
</reference>
