<?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-02">
   <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>Arista Networks</organization>
      </author>
      <date month="March" day="23" year="2022" />
      <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 provides mechanisms to create
   constraint based paths in 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-02" />
   
</reference>
