<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.39 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-czz-rtgwg-elastic-bandwidth-routing-00" category="info" submissionType="IETF" xml:lang="en" version="3">
  <!-- xml2rfc v2v3 conversion 3.34.0 -->
  <front>
    <title>Elastic Bandwidth-aware Routing Framework</title>
    <seriesInfo name="Internet-Draft" value="draft-czz-rtgwg-elastic-bandwidth-routing-00"/>
    <author initials="W." surname="Cheng" fullname="Weiqiang Cheng">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>chengweiqiang@chinamobile.com</email>
      </address>
    </author>
    <author initials="K." surname="Zhang" fullname="Ka Zhang">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>zhangka@huawei.com</email>
      </address>
    </author>
    <author initials="L." surname="Zhang" fullname="Li Zhang">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>zhangli344@huawei.com</email>
      </address>
    </author>
    <author initials="L. M." surname="Contreras" fullname="Luis M. Contreras">
      <organization>Telefonica</organization>
      <address>
        <postal>
          <country>Spain</country>
        </postal>
        <email>luismiguel.contrerasmurillo@telefonica.com</email>
      </address>
    </author>
    <author initials="J." surname="Dong" fullname="Jie Dong">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>jie.dong@huawei.com</email>
      </address>
    </author>
    <date year="2026" month="July" day="06"/>
    <area>Routing Area</area>
    <workgroup>Routing Area Working Group</workgroup>
    <keyword>Bandwidth</keyword>
    <keyword>IGP</keyword>
    <keyword>Load-balancing</keyword>
    <keyword>Routing</keyword>
    <abstract>
      <?line 85?>

<t>IGP normally computes the shortest paths in a network for packet forwarding, without taking the traffic demands and available bandwidth into consideration. When there is a link degradation or partial link failure in a network which causes throughput reduction, or the volume of specific traffic flows increase dramatically, unexpected congestion may happen if only the shortest paths are used for IP forwarding.</t>
      <t>Conventional centralized Traffic Engineering (TE) focuses on long-term bandwidth and routes planning based on traffic demands, which can not react to the congestions in networks timely.</t>
      <t>This document describes a distributed path computation and load balancing mechanism named Elastic Bandwidth-aware Routing (EBR), which can alleviate congestions timely before TE finishes the global optimization. It allows IGP-enabled nodes which face congestion to distribute traffic among the shortest paths and load-balancing alternate paths through Segment Routing Traffic Engineering (SR-TE), with weights determined based on the bandwidth utilization and available bandwidth of these paths. It provides an efficient, accurate and backward compatible approach for dynamic link congestion avoidance.</t>
    </abstract>
  </front>
  <middle>
    <?line 93?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>IGP normally computes the shortest path in a network for packet forwarding, without taking the traffic demands and available bandwidth into consideration. Although IGP TE extensions allow to advertise link bandwidth related information in link state advertisements, such information is not used by IGP for path computation. When there is a link degradation or partial link failure (e.g. bundle member link failure) in the network which causes throughput reduction, or the volume of specific traffic flows increase dramatically, unexpected congestion may happen if only the shortest path is used for IP forwarding.</t>
      <t>As IGP itself usually does not react to link bandwidth changes or congestions, this means the congestion problem currently can only be solved by manual adjustment (e.g. adjusting the link metric) or network controller-based traffic steering, resulting in long (usually from minutes to hours) recovery time and large economic losses.</t>
      <t>Although traffic engineering (TE) technology has been widely deployed in networks, the TE paths are usually pre-calculated by the ingress nodes or a centralized controller based on the bandwidth requirements and the available bandwidth in the network. However, this information is not always predictable, when unexpected changes happen (either in the available bandwidth or the bandwidth requirement), conventional TE technology can't react to these changes timely.</t>
      <t>This document describes a distributed path computation and load balancing mechanism named Elastic Bandwidth-aware Routing (EBR), which can alleviate congestions timely before TE finishes the global optimization. It allows IGP-enabled nodes facing congestion to distribute traffic among the shortest paths and pre-calculated load-balancing alternate paths through Segment Routing Traffic Engineering (SR-TE), with weights determined based on the bandwidth utilization and available bandwidth of these paths. It can reduce the burden and dependency on the controller by reducing the involvement of global TE.</t>
      <section anchor="requirements-language">
        <name>Requirements Language</name>
        <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
        <?line -18?>

</section>
      <section anchor="terminology">
        <name>Terminology</name>
        <dl>
          <dt>Load-balancing Alternate path:</dt>
          <dd>
            <t>Alternate TE routing paths used for traffic load balancing when the primary path is congested.</t>
          </dd>
          <dt>Congestion Threshold:</dt>
          <dd>
            <t>A configured value, when the bandwidth utilization of a local link exceeds this value, then the traffic distribution is initiated among the primary path and load-balancing alternate paths.</t>
          </dd>
          <dt>Restore Threshold:</dt>
          <dd>
            <t>A configured value, when the bandwidth utilization of a local link falls below this value, then the traffic distribution among the primary path and load-balancing alternate paths is canceled for the local link, and the primary path forwarding is restored.</t>
          </dd>
          <dt>Local Load Balancing Node (LLBN):</dt>
          <dd>
            <t>An EBR-enabled network node, which performs traffic load balancing upon detecting congestion on one of its local links.</t>
          </dd>
        </dl>
      </section>
    </section>
    <section anchor="use-cases">
      <name>Use Cases</name>
      <t>EBR aims to alleviate the link congestion caused by unexpected events timely. The typical use cases include but are not limited to link congestions caused by link degradation and burst traffic.</t>
      <section anchor="congestion-caused-by-link-degradation">
        <name>Congestion Caused by Link Degradation</name>
        <t>Existing IGP protocols calculate the shortest paths for traffic forwarding, it usually does not consider the actual link bandwidth and the traffic rates on the links. As a consequence, congestion may occur when network failure results in capacity reduction on a network link. An example network topology is shown in <xref target="ref-to-fig1"/>.</t>
        <figure anchor="ref-to-fig1">
          <name>An example network topology</name>
          <artwork><![CDATA[
+-----+     cost=1       +-----+     cost=2        +-----+ 
|  A  |==================|  B  |===================|  C  |
+-----+                  +-----+                   +-----+  
   ||               cost=2  ||                       ||
   ||                    +-----+                     ||
   ++====================|  D  |=====================++           
         cost=3          +-----+           cost=2  

]]></artwork>
        </figure>
        <t>There are four nodes A, B, C, and D in the network, between each pair of the adjacent nodes, two fibers are bound as one bundle link. The shortest path from A to C is A-&gt;B-&gt;C. However, one of the fibers between A and B is broken due to unexpected events, but IGP protocol does not perceive this change because the link state connectivity does not change. Then the shortest path from A to C is still A-&gt;B-&gt;C, and the traffic from A to C is still forwarded along A-&gt;B-&gt;C. As a consequence, congestion may occur between node A and B, since the link bandwidth has been reduced by half. However, there are alternate paths from A to C (A-&gt;D-&gt;C and A-&gt;D-&gt;B-&gt;C), which provide plenty of available bandwidth. A mechanism is needed to distribute the traffic among the primary path and the alternate paths to accommodate the traffic during link failure and avoid congestion on the shortest path.</t>
      </section>
      <section anchor="congestion-caused-by-burst-traffic">
        <name>Congestion Caused by Burst Traffic</name>
        <t>Another example is the congestion caused by bursts traffic. Considering the same network topology as described in <xref target="ref-to-fig1"/>. The shortest path from A to C is A-&gt;B-&gt;C. Generally, the bandwidth of the link from A to B is capable of carrying the traffic from A to B. However, there may be some burst traffic from A to C due to some unexpected events (such as a concert or a football match), and the traffic exceeds the available bandwidth of link A-B. As a consequence, congestion may occur on the link from A to B. However, there are alternate paths from A to C (A-&gt;D-&gt;C and A-&gt;D-&gt;B-&gt;C), which provide plenty of available bandwidth to accommodate the burst traffic and avoid congestion. A mechanism is needed to distribute the traffic among the primary path and the alternate paths to accommodate the traffic burst and avoid congestion on the shortest path.</t>
      </section>
    </section>
    <section anchor="overview-of-ebr">
      <name>Overview of EBR</name>
      <t>This document proposes a new mechanism called EBR for dynamic congestion alleviation. EBR integrates IGP with SR-TE traffic steering, allowing the distribution of traffic among the primary path and multiple load-balancing alternate paths based on the perception of link congestion and bandwidth information of the whole network. It can effectively alleviate the congestion caused by different network events.</t>
      <t>EBR consists of four major steps:</t>
      <ol spacing="normal" type="1"><li>
          <t>Monitoring and advertisement of link bandwidth information: Each EBR-enabled network node monitors the available bandwidth and bandwidth utilization of its local links, and advertises the update of bandwidth related information to other nodes using IGP.</t>
        </li>
        <li>
          <t>Load-balancing alternate path calculation: Each EBR-enabled network node calculates both the shortest path and load-balancing alternate paths to a specific destination. The algorithm for load-balancing alternate paths should try to keep the shortest path and the load-balancing alternate paths disjoint.</t>
        </li>
        <li>
          <t>Traffic distribution upon congestion: Once a LLBN detects that the bandwidth utilization of one of its links exceeds the Congestion Threshold, it will distribute traffic whose shortest path is via that link to the load-balancing alternate paths based on Unequal Cost Multiple Path (UCMP). The traffic forwarding on load-balancing alternate paths should be based on SR-TE to avoid forwarding loops. The weight of each load-balancing alternate path is determined based on the available bandwidth and bandwidth utilization of the paths.</t>
        </li>
        <li>
          <t>Traffic fallback: When some conditions are met (e.g., bandwidth utilization drops below the Restore Threshold), the load balancing is stopped and all traffic is reverted back to shortest path forwarding.</t>
        </li>
      </ol>
    </section>
    <section anchor="ebr-procedures">
      <name>EBR Procedures</name>
      <section anchor="monitoring-and-advertisement-of-link-bandwidth-information">
        <name>Monitoring and Advertisement of Link Bandwidth Information</name>
        <t>LLBN needs to continuously monitor the bandwidth utilization and available bandwidth of its outbound links. The bandwidth utilization is the key information for determining whether a link is congested. The determination of a link congestion depends on a configurable Congestion Threshold (such as 80%, 90%, etc.), which can be configured by network operator according to the network conditions.</t>
        <t>The mechanism used to obtain the bandwidth utilization information of a local link is out of scope of this document.</t>
        <t>Upon local link congestion, distributing traffic blindly to alternate paths may lead to new congestion occurring on other links. Therefore, it is crucial to obtain the information about the available bandwidth and bandwidth utilization of each link in the network. With such information, the headend can distribute traffic based on the available bandwidth and bandwidth utilization of the links on each path, thereby avoiding the occurrence of new congestion.</t>
        <t>The advertisement of bandwidth information can be achieved through IGP advertisement. Existing TE metric extensions to IGPs already allow a node to advertise the bandwidth related information (e.g. maximum link bandwidth, available bandwidth, and utilized bandwidth, etc.) of its links (IS-IS<xref target="RFC8570"/>, OSPF<xref target="RFC7471"/>). The considerations for bandwidth information advertisement is introduced in <xref target="advertisement-considerations"/>.</t>
      </section>
      <section anchor="load-balancing-alternate-path-calculation">
        <name>Load-balancing Alternate Path Calculation</name>
        <t>The load-balancing alternate paths in EBR are used for load balancing when the primary path is congested. Although the algorithm used for load-balancing alternate calculation is implementation-specific, it should meet the following requirements:</t>
        <ol spacing="normal" type="1"><li>
            <t>The load-balancing alternate paths should be calculated by LLBN in advance to allow quick triggering of load balancing when local link congestion is detected.</t>
          </li>
          <li>
            <t>The calculation should make that the load-balancing alternate paths and the primary path are disjoint as much as possible.</t>
          </li>
          <li>
            <t>The bandwidth utilization of each link may be considered during the calculation, to avoid using links with high bandwidth utilization for congestion traffic offloading.</t>
          </li>
          <li>
            <t>Depending on service flow needs, other metrics and constraints may be considered during calculation.</t>
          </li>
        </ol>
        <t>The number of alternate paths depends on the configuration and network topology. The algorithm for calculating load-balancing alternate paths is out of scope of this document.</t>
      </section>
      <section anchor="traffic-distribution-upon-congestion">
        <name>Traffic Distribution Upon Congestion</name>
        <t>Once a LLBN detects the bandwidth utilization of one of its outbound links exceeds the Congestion Threshold, the load balancing mechanism will be triggered to distribute traffic among the primary path and load-balancing alternate paths.</t>
        <t>UCMP is recommended to distribute flows among the paths, the weight of each path is determined according to the available bandwidth and bandwidth utilization of the path. The available bandwidth of a path is the available bandwidth of the link with the smallest available bandwidth on the entire path. The bandwidth utilization of each path is the utilization of the link with highest utilization rate on the entire path.</t>
        <t>Once the weight of each path is determined, it will not change unless new congestions are detected on the links of load-balancing alternate paths.</t>
        <t>Traffic distributed to load-balancing alternate paths will be forwarded based on SR-TE mechanism, which ensures the traffic be forwarded without loops.</t>
        <ul spacing="normal">
          <li>
            <t>For SR-MPLS network, packets will be encapsulated with an ordered list of MPLS labels which represent the load-balancing alternate path.</t>
          </li>
          <li>
            <t>For SRv6 network, packets will be encapsulated with an outer IPv6 header, together with an SRH which contains the SID list representing the load-balancing alternate path.</t>
          </li>
        </ul>
        <t>Policies may be used for determining which groups of flows (e.g., according to traffic class, IP prefixes, etc.) should be migrated from the primary path to the load-balancing alternate paths.</t>
      </section>
      <section anchor="traffic-fallback">
        <name>Traffic Fallback</name>
        <t>Traffic fallback means a LLBN migrate the traffic on load-balancing alternate paths back to the primary path. This process restores the network to the original state. There are several methods for triggering traffic fallback:</t>
        <ol spacing="normal" type="1"><li>
            <t>Threshold-based traffic fallback: When a LLBN detects that the bandwidth utilization of a congested link falls below the Restore Threshold, then the traffic fallback is triggered.</t>
          </li>
          <li>
            <t>Dynamic traffic fallback: In this method, there is no static threshold for traffic fallback, the fallback is triggered dynamically upon the local link of the LLBN can bear all the traffic without congestion.</t>
          </li>
        </ol>
        <t>In both of the above methods, the traffic fallback should be triggered only when the conditions have been met for a configurable period of time.</t>
        <t>Method 2 is recommended as it can avoid oscillations in traffic distribution and traffic fallback.</t>
      </section>
    </section>
    <section anchor="operational-considerations">
      <name>Operational Considerations</name>
      <section anchor="oscillation-suppression">
        <name>Oscillation Suppression</name>
        <t>Micro-burst traffic or flapping bundle member link may cause frequent change of the link utilization and congestion state, and may result in oscillation in traffic distribution. The following oscillation suppression measures should be taken:</t>
        <ul spacing="normal">
          <li>
            <t>The determination of congestion and restoration should consider the statistical characteristics of bandwidth utilization over a period of time, rather than only bandwidth utilization in a short interval.</t>
          </li>
          <li>
            <t>If threshold-based traffic fallback is used, then the Congestion Threshold should be sufficiently far from the Restore Threshold to avoid oscillation in the link's congestion status caused by small traffic fluctuation.</t>
          </li>
        </ul>
      </section>
      <section anchor="alleviation-of-possible-new-congestions">
        <name>Alleviation of Possible New Congestions</name>
        <t>The available bandwidth and utilization of load-balancing alternate paths are considered in traffic distribution, which effectively reduces the possibility of secondary congestion on the alternate paths. While in some cases it is possible that distributing traffic from primary path to load-balancing alternate paths may cause new congestion for the following reasons:</t>
        <ul spacing="normal">
          <li>
            <t>The available bandwidth of an alternate path does not match the rate of assigned flows. Although UCMP is used in the distribution of flows to alternate paths, due to different size of flows, a big flow may cause new congestion on some links of an alternate path.</t>
          </li>
          <li>
            <t>Simultaneous traffic distribution initiated by different nodes. Since network nodes which support EBR act independently, simultaneous traffic distribution is possible, which may cause the total diverted traffic rate exceeds the available bandwidth of some links of an alternative path.</t>
          </li>
        </ul>
        <t>There are two mechanisms to alleviate the new congestions.</t>
        <ul spacing="normal">
          <li>
            <t>When a LLBN which initiated the traffic distribution perceives that the bandwidth utilization of an in-use load-balancing alternate path exceeds the Congestion Threshold, it can adjust the traffic distribution weight on different alternate paths to reduce the flows on the congested paths to relieve the congestion.</t>
          </li>
          <li>
            <t>The LLBN which is adjacent to the newly congested link can initiate traffic distribution and divert a portion of traffic to its load-balancing alternate paths to alleviate the congestion.</t>
          </li>
        </ul>
      </section>
      <section anchor="advertisement-considerations">
        <name>Considerations on Bandwidth Information Advertisement</name>
        <section anchor="trigger-of-bandwidth-information-advertisement">
          <name>Trigger of Bandwidth Information Advertisement</name>
          <t>Although the effectiveness of EBR relies on the accuracy of available bandwidth and bandwidth utilization information, the control plane overhead in the advertisement and processing of the bandwidth information update also needs to be considered. Some recommendations about bandwidth information advertisement are provided as follows:</t>
          <ul spacing="normal">
            <li>
              <t>The interval of two advertisement must not be less than the Minimum Advertisement Interval. The Minimum Advertisement Interval should be configurable, 30 seconds is recommended for it.</t>
            </li>
            <li>
              <t>If the Minimum Advertisement Interval expires, and there is a x% change in link available bandwidth since the last advertisement, then an advertisement should be sent. The value of x should be configurable, and 20% is recommended for it.</t>
            </li>
            <li>
              <t>If the Minimum Advertisement Interval expires, and there is a consumption of over y% the link’s physical bandwidth and that was not noted in the previous advertisement, then an advertisement should be sent. The value of y should be configurable, and 70% is recommended for it.</t>
            </li>
            <li>
              <t>In order to prevent the clustering of IGP messages on the receiving nodes, a “jitter” can be introduced. It is recommended to set the jitter value to 1/3 of the Minimum Advertisement Interval.</t>
            </li>
          </ul>
        </section>
        <section anchor="optimizations-on-bandwidth-information-advertisement">
          <name>Optimizations on Bandwidth Information Advertisement</name>
          <t>As the advertisement of bandwidth information in IGPs are mainly for RSVP-TE based TE path computation, there may be concerns that advertising such information more frequently may affect those TE applications. The mechanisms with Application-Specific Link Attributes as defined in <xref target="RFC8919"/> could be used to limit the usage of more frequently advertised bandwidth information to EBR, so as to avoid the impact to other TE applications which may use bandwidth information as its input.</t>
        </section>
      </section>
      <section anchor="compatibility">
        <name>Compatibility</name>
        <t>EBR can be deployed incrementally in the network. Network nodes which support EBR can calculate the load-balancing alternate paths and initiate UCMP load-balancing upon local link congestion. Network nodes which do not support EBR do not calculate the load-balancing alternate paths, and will not initiate UCMP load-balancing, while they can forward the offloaded traffic according to the SR SID list in the packets.</t>
        <t>Author's note: more operational considerations will be added in future.</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>EBR relies on the bandwidth information advertised by IGP, incorrect bandwidth information may lead to new congestions on specific links. In most deployments, the EBR is used within a network domain entirely under the control of the same operator.  However, it is worth considering that transporting link bandwidth information over insecure links could include a man-in-the-middle attacker modifying the value of bandwidth information, and causing congestions on specific links.</t>
      <t>Advertising which links are approaching congestion may give an attacker a good plan for how to destabilise the network. Destabilisation may simply involve injecting an edge-to-edge (i.e., no need to change anything inside the network) flow that will tip the identified link into congested state.</t>
      <t>The use of cryptographic authentication mechanisms of link state advertisement can mitigate the above risks.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC8570">
          <front>
            <title>IS-IS Traffic Engineering (TE) Metric Extensions</title>
            <author fullname="L. Ginsberg" initials="L." role="editor" surname="Ginsberg"/>
            <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
            <author fullname="S. Giacalone" initials="S." surname="Giacalone"/>
            <author fullname="D. Ward" initials="D." surname="Ward"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <date month="March" year="2019"/>
            <abstract>
              <t>In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network-performance criteria (e.g., latency) are becoming as critical to data-path selection as other metrics.</t>
              <t>This document describes extensions to IS-IS Traffic Engineering Extensions (RFC 5305). These extensions provide a way to distribute and collect network-performance information in a scalable fashion. The information distributed using IS-IS TE Metric Extensions can then be used to make path-selection decisions based on network performance.</t>
              <t>Note that this document only covers the mechanisms with which network-performance information is distributed. The mechanisms for measuring network performance or acting on that information, once distributed, are outside the scope of this document.</t>
              <t>This document obsoletes RFC 7810.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8570"/>
          <seriesInfo name="DOI" value="10.17487/RFC8570"/>
        </reference>
        <reference anchor="RFC7471">
          <front>
            <title>OSPF Traffic Engineering (TE) Metric Extensions</title>
            <author fullname="S. Giacalone" initials="S." surname="Giacalone"/>
            <author fullname="D. Ward" initials="D." surname="Ward"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="A. Atlas" initials="A." surname="Atlas"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <date month="March" year="2015"/>
            <abstract>
              <t>In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network performance information (e.g., link propagation delay) is becoming critical to data path selection.</t>
              <t>This document describes common extensions to RFC 3630 "Traffic Engineering (TE) Extensions to OSPF Version 2" and RFC 5329 "Traffic Engineering Extensions to OSPF Version 3" to enable network performance information to be distributed in a scalable fashion. The information distributed using OSPF TE Metric Extensions can then be used to make path selection decisions based on network performance.</t>
              <t>Note that this document only covers the mechanisms by which network performance information is distributed. The mechanisms for measuring network performance information or using that information, once distributed, are outside the scope of this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7471"/>
          <seriesInfo name="DOI" value="10.17487/RFC7471"/>
        </reference>
        <reference anchor="RFC8919">
          <front>
            <title>IS-IS Application-Specific Link Attributes</title>
            <author fullname="L. Ginsberg" initials="L." surname="Ginsberg"/>
            <author fullname="P. Psenak" initials="P." surname="Psenak"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="W. Henderickx" initials="W." surname="Henderickx"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <date month="October" year="2020"/>
            <abstract>
              <t>Existing traffic-engineering-related link attribute advertisements have been defined and are used in RSVP-TE deployments. Since the original RSVP-TE use case was defined, additional applications (e.g., Segment Routing Policy and Loop-Free Alternates) that also make use of the link attribute advertisements have been defined. In cases where multiple applications wish to make use of these link attributes, the current advertisements do not support application-specific values for a given attribute, nor do they support indication of which applications are using the advertised value for a given link. This document introduces new link attribute advertisements that address both of these shortcomings.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8919"/>
          <seriesInfo name="DOI" value="10.17487/RFC8919"/>
        </reference>
      </references>
    </references>
    <?line 296?>

<section numbered="false" anchor="acknowledgements">
      <name>Acknowledgements</name>
      <t>TBD</t>
    </section>
    <section anchor="contributors" numbered="false" toc="include" removeInRFC="false">
      <name>Contributors</name>
      <contact initials="Y." surname="Wang" fullname="Yifan Wang">
        <organization>Huawei</organization>
        <address>
          <postal>
            <country>China</country>
          </postal>
          <email>wangyifan82@huawei.com</email>
        </address>
      </contact>
      <contact initials="H." surname="Wang" fullname="Haibo Wang">
        <organization>Huawei</organization>
        <address>
          <postal>
            <country>China</country>
          </postal>
          <email>rainsword.wang@huawei.com</email>
        </address>
      </contact>
      <contact fullname="Yusheng Zhang">
        <organization>Huawei</organization>
        <address>
          <postal>
            <country>China</country>
          </postal>
          <email>ryan.cheung@huawei.com</email>
        </address>
      </contact>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+Vc624cR3b+T4DvUJFgmIpnZiVZiW1iZZs3WdwlRYakIjhB
ENR018yU1N3V2xeORhfDr7HABsiz5FH8JDmXqu6q7h7OyE6yWITYtcierss5
dS7fudSMx+PdnbKSWfzvMjGZ2hdVUavdHZ0X9GtZPX748JuHj3d3IlntC53N
DLxfT1Ndltpk1SqHIacnN892d2Sh5L64MnWls7k4gL92d5bz8Il4ZYo3+McP
hanz3Z3dndhEmUxhkriQs2ocvXs3Lqr5cj5WiSwrHY2nsLeljqvFuOCJxg8f
7u6YaWkSValyf3enzmPJv+3uVLpKYLITHiwOm8FyCftr9vKsgDWXsBcck8gM
tqmy3Z03S5hEjNth9NfpD5f075mRMWwHXo9gDnpk58NZZF0tTEGbAJYKYFW5
L15NxNFC0cuCyXyl9J80LNg+NwWsfrTQmRTnZqoThQ8jU2dVsbIf4BOVSp3s
iwiHLe0k30f4aUqjJpFJw8X/OBH/spD+4n+U7RNa9nktYa47F3yHA97I7xf0
an+Vs94qZ/pXrpLoL588uWuhc2AnCF2hCll669W67H1EC9+oRM1MpiMZLH6d
S515iycwQarntUpgVTtHWhc6Scz3VTNFf0d/mIhj41P+B62aJ9tS/lqrSQxj
OnTTRvS0rnoy9eNEvAr4/aOeyax5tu26S3h/hSO/fryW5c+7Sz2Xemo+eakC
2F2CtsUTXHRotVmdJJaYukQJDyRIZvqdrMDcbLfaSmYTUJO6t1RmihTmuVXE
UbRl/t/j8VjIaVkVMqrwb1B7QSOSZAWrpXkNRkZUCyVKUHT4vRK5rBYlsEpI
kakK7YmAOeFx9EZV+CsYnRjsw0gsNViHuhKVJPOHs8BCsxnYqBj2ncWlgP8I
eQskyGmiRGP2YPrKwPpZqWMQTGQDnArwCCcBkwayL0Wiszcw0byQMb0haBdF
pWXCn81g3hrf9ve6XOhoISJZl0QY2Nf5AqgUhYrrCKcZ4Ty411uT1KkSZibK
XEUat+22P0vMEnkQgXkvFZpx5GmEXBuJOlNvYUClYqRgDjzDzaVyJRYyz4EG
PRMmA/4OsBXtNewsJpaeXnrsnODxgLbfqgznAxoj+K2QiX4Hr9/YjZ1kc50p
VSC/925OHsAEEVEKOwBXNx9Xqkg9PiP/0cXAGznY+AzHTSVuAAZ0DmvU8C4D
GUGOgdAIOCeko6WUZMNyGzisU5WsaPM3Czg2cH3A1KyCScsIdF3hSca6ZL2H
dZEPVvL4VHGLCXgh0XghkaoINAXsF2lovNHz7Z0cXj3wtw8HpW41ONBg37xX
MQXbB4NvTsRMwyILqwDzxMAOhMnhNauaE3Fa4VwoDKA5Y5WhGMfAHaDOLjeT
kb8K8qslt2Ex+DOrIV2BsNS3PhgWhEPMcPP8ihVica3mxFlH9aBMXF+NQSxY
NwWYifmigkNRKBbwUuwd/sLXR5gxsUSv1VlQFBhU2m0Rb/LC3GrkBfBc4WY0
bHAkZBTVBRKAU03BcKCM06HDCjgp6ElhJHIP1CBewSkDHaTTHiflrdEx8ERN
hDNlqY5jxBK7O/fFKWiHsTr9Cabtr2HZDhKcDo4Q9whyp95WKitJJkm6UGhk
fKvAtgF7iQ/thAWARlScxrQDa4AGegtALnLZDUXxADUu62gRvl6SQpPhma5o
F0x4qIq/wQTvqcl8IqZ1BscD6ptOVRG88AC3jGz8WzDTSPsdRvqAjIHQVamS
GbxYk8TFRpWh2eycI5q0OVrqwjdKI1gelkuVzMqOoUXtAtlKBShTASeLYg16
RnuewpZNcsvnCQIJewAxeA2hDZkIPg5+4ASYtpMqsEzRA9yEOwkCZQYMZjFm
4+C4W1ZsVEZAUlknNJFmNyP2HNmzwqSglhkrmxEg50X5AEZEBoRyRTaXjZws
5krA48yQspsSTp756bTDLay6Tq4Cf5CZxMzx7EogHk4PmIrGPFZ5YlakHo1T
GhG9oGe+z+Xt5oUag3xENevUlE8fFgISS2vXgTcycL4th9aZz0L9qdYF6x9R
ix8PWwdfCybiuVkq4JOVggGdlclSrkrcd6yjCmdDPwf0++JtJcvK9Z7SqMJu
rUFTXqwnAJxH5MMQ4KPHf5DAz0NoAIrnNvD/GAwADMDFfxsQ6Ejn3y4uQLaT
JVc8X13EiicAfVUZ/BGt3GK+dq14lDNZOrtFI0fUwSr2UG5OSMLu3xdXvtqd
gQzWcq5Y+pR4o1YC47NS3Dt/eX1zb8T/ihcX9PvVyT+9PL06Ocbfr58fnJ01
v+zYN66fX7w8O25/a0ceXZyfn7w45sHwVASPdu6dH/wInyC59y4ub04vXhyc
3WN19JUChRaEZIp0wjnA4eOhy3LHaQsZtcOjy//6z0dPxPv3f3f17Ojxo0ff
fPxo//j60VdP4A80B7wauQb+E9i32kF7IMkQgNzCoeS6kgmYR7ChIH3LTKCn
n+zs/P2/Imf+bV/8fhrlj558ax8gwcFDx7PgIfGs/6Q3mJk48GhgmYabwfMO
p8P9HvwY/O347j38/XfgApUYP/r6u293rATdkPyTacMnYTYMcZuncRBQ73uP
wGTY5J3VxwYyOF3vGLKlBVeg5jqV4Bsd1rBGQ8UuBnQm5GYBbmlhknhf0Nr4
5kzPAU/F4lYmtfMF63UWtAZQnIkcXlNvI6XikiXRTlG5KRqI68yW9UNgGCtN
Fqm1XgENm4MYouwKyCJj25D1P0TVDMQbYQFB6a0p+9XE0JlhYJK4A0d41Wxn
1CCAYN4WReL4gnnBR35GY1H4wKu5RV+AXxF7Z2eHLx4wnzIBnq11Oxa+oftx
3i5XBQKIcp0E1jmQjUY/qjrOiv5HIBtgrUcLH9x98RLM+xG4iBL/hG0IqVPC
e61zbTCmNy3he4JZHlxRt2SvLVgQaKurVY6wHVUIxmBIAKA+qWN0HWwoEQsl
4ItxAoetfXfertSLWSgIBVRaObY49+Fp2lEz/AyHH7fDieC3mnE04n5A5ZWJ
TIJrWlc95M99Q+CHlrrqhwwuXGS8FlW1E+wwkeNLMobXpXOhfFLiAOEVzgVu
ETysGnUDH4NxOStXEwDbAI4hPuV2wE8AmKlWbSyG67QxM642QXFUb2WaJ21M
V5mcQaJ2/gVme/++ULNxZcag4o8+fiTe//TTT/jPF2P8+ULgT2TK6ukjwT+9
Dx6Lzie7Ox8EWA7x4WnvBz44HPwAPzmCT8KFg5+1H7SfYFJWfPjQ+djtsveB
+/nwYXjghmWbgV98MUAQUnQ8TOvTp1/489Ec3la/vGtxR0xzVO/3xX3vFAUV
pJ7eu0ME7n20MAxEC9V3BmGhRcoHI3E4EkdsJY87EdEIrHi1xPhOYXool7qw
+BKjWYlRGU8Dxn1pALNPVcER3tTUiE9LsmM2EcGSetOL7yloPUA7coSyejD+
9nD87ZEXjVlbiMvaJdy2DmjbhzhsWpg38CSuCcb1DNyIbJdvMVqFB0MdKX2r
2Ftx+ARLkBFrDSlnd0CHMzTYt6iSrcmgMURcNpDB6FAIJgAAoKVz1DMmg29b
o4Ven0L+hktbmhnHMTwux7aRKMGweyS2Bq4J7DluIFu8kMksiJGdOHUdsk/A
Hmz0GDZKK/LvuO8mJLQ5SwFimwFHEUv0gxqg0gs8MRYH2MSuxw/qFkOBXQ9N
kPR2gzeDWVKTpiaWnZnimkK2IL/GsZfRccdp906ec6XrnNshuUEbIFLuBWQJ
cwVOj3UvCdU6VvKhDbag0iR5LRetlRCe932BLEUQz3T9wSeo5w8qUwUn90Js
aFWVOdYMPmScltPJwiuRLIpVN53rvd6TNJRlSrSlKgQQwQ6t/tNbfZSzR8lY
aVUmUkXF+aWZMdUUo7JUVtHiQV8nW6S+JoUzY3oPxodbq6QHF+4k/P9ExYZU
IOTykND/NRWTd/epqigugLO3Wi2RDwCd+9kxYFduSkqOZfBaSx5msjHjBXjb
L5T4NRILv4kz+B6mEuYMDtH1ULqHcj8DaV1KZjmFCEIjVKjN7EsxKYxWY0O4
FOSWyPXlbpVezYcKRm22tM2HWh1fQtzo5U9trknNZuQiMaMXRiSDlizW8H5B
WMKaK9bWiYtuCJCjsYNVCbqk8jUcALAu55acRxNxbiAsNmT9SCT8IkxD2iAt
++IEwc26aE6kPPN63Q+51ImMOwHcKNwdT8rdRfj23XUmUAb2Dwzd6tIGQcSo
x5NO91Dn4Jv4aAuSm1AKpMWgbeg5hW0KpaC6bZEoxmPPrGrckKbP4biqRUrK
tGEuWLxOsBaywmnfKJWv2RPH/nfOBar12oBiskH4ctJkaAOdo+C8Fdd9cYFI
SQrMANigHQ9PVncnRvwwHs8/cCRDuSUKSZeI+AbS1aBu5UB1DPSLt0JCblsE
trUCLzPwUiCeRxBmiHNnQy5x6r2XR+eXD2xOoBc8c5PDNsc2Ve1y1voZa7S9
6RJj8pIX44w4Mo7ijjtXQQasy5x/sraSSeS8OQrHk1Y4MKmFtfN9rsoSvgDx
iDUnPNBHp8qW+kZrFojBs7SJMSV6GbgHo+bovDwRxQAmzxH7o/EA2XCnQakr
tCWKK/sEfUL01lZLrQNEi3pZGAD1AGVLi0875vOgaz4pD9PUeMRpa5UoY4ZK
kbFcU7kdVL02dQn231rPX1fIQLUxdcXBpE2r3KydyKJlrDT4VpN8tRUQm/gl
I2rr6UHGl2Z3L/vZzY5j5LpJyZkYlzCl/Q/pdAs7v3742Uh8g/9RVTQJ6mJT
5WdewS06i2xy7FxAmApAiFXFqrhXM7ZyyGeMRLSwhdwsuo5pJfVdedyOfw9y
upoOgsr+EWyIdcVDTeSCXuZkEppBLcNGnnHF/TsIB6/FyYozl6HpQJicKEk7
RxjmoztEz4W1QOwQW9koqIJIVhRPtqgj7I4IyfcJlVPqLPk1xoJtE3GnU0d+
hTiv2/fBur0AmkB06MgHLPxvN1/sZkyTsqkWNo4AkSKb6yAmsxHjExwa8nji
xKiHo4bhoBVgWFErbINwxVAEvcEUAItd9hbcAPc/+A04cFAwBhtxCmDUyjbk
SIYlQV9Ot2Leh0vcdpHKtzqt0w4AHA0xl8EZ81TF/nPS1tCR751ej0+v37//
Dkt///DVw48fR+Li+vIZP/nqyVcQTlvfGfQfcS56mI0ht6nWw11VLlgPXhiH
89psLhjztXUz8upHLQ50p7ypwEK1jrBb8tOraW3fVRXAv2DKwV14yJWYgrkR
ZAA9GTuISTpvEUeqFCv1zLioym8KcUHDFrS3ECZsVCGXp+nIJOXQjJVVWAX9
cKHnc07GYPAxwKxBO+nATOTKj4+tBHkccCTKN6oFoBuoGCyB4Xk6MIzOKbVO
CqLfEvsCW4B8F8JtraBN0DipBD7Z3FkVUjBq4R+HMKxQFBwvAPitWWsWtGo1
FtPMZkh8A3AAsx2Td7YOosRwHw4Iu9MYo4ys02Drw8zBTVfYRF6V6+nwaGgM
ZFZTdx36y26c0WIEG/oySmhATzc5NxQXNUsSQN5UBt3sorHIbhl37Ic75Lpb
7IKvDgc828U6IWjbIugZgL0tgqFwaKqcUvXzS5uTI1vUwzHYYUCN+SZsi+mu
ww2O3io4lvfeiVgGApMeevvVwYmVk2HILJu170hVNmlH0jmKpLFRF4OGwREs
wdiDVvhbuNsm+PtYg1Nancel/ZeoX3lg3UYwt2J6G0y3RRpRZwl1FwaAhyM4
Z3qDSq4z4BvEp5dFsKXxu5XWiXZb3ulEyo0WuFgBkBLGbWEq1J/AdUtzPE29
2uIZmBKY7/zy7Lqt7XGndbsHgIIyL62Lo5PB/taCTWACZCEnaAoQEJW4lvtC
5bAfBCwbHZFtHbfbuf3HT90LMBVbgGEgwWjMkJs5R3Puneur5y6ogjAUbwXR
tq5Pj5mEZrdNI+7mDV+aBHvpG8/QIJYwrMRF53jpkBOVZCxsPiBUfntqUSJL
MB+nWJJUM/0Wy6gMNFvQkWpKH8ec8O+Ztq1yPU0RyonoM5vL8MXW5Tds77O1
+3b5QNg2p31cJqK7XbQaGrtnTYQaaJtuyiCWtcPABc419rtS1dVGdqSjJeY7
4APw3gsTu86OBm1V3XxNA/Wsr+m0VXfyOp+c4JMtwh3qfhpI8gw0QjXMR3Pp
nJzDf8e2ztDf8antYWRWuHIRtSoT33BQk4MIOmDsFOy7Bld35Q1qjaFkaBW0
VTkzTuzi8E8WnJvyCHO2qBNZwsYpr+x6CabmVrkDHQ1zplWJdotNg6UDWC4b
t5C3isvXKV8l6WZpchAWE9P6OlW0p3NaXjzuQgAAxJrLGgxZTRmBjZLN3avh
ZrasL2G2d+sitwEb5Vz9AM5q6UW7gLiuczRXpYVk5zoqzDgsywFxs0TmOd0l
69/4QJPFjQyzgsqRjR/0/XA3H+fhbFJAjoxxLu5MQsI9RqzjA8OENgbzh5Qt
aWhz2Kl5pwzhTcaXJoeTcp0yFRuTIEIK+rhIH0q6joIMwBuYIAP4oAzTGoF+
31KeMJSWEYKTBU3b3P9Yk0/DAghmY7ml+FYmzgGezlrNXGOQ3LUXz1wM5hZb
lpW1u/OFN0FAGxuf0bNBbQTWPUUrEZ+XXRmo/a4+govexZ8au+Qa9QYhPmgr
oci3SxtSiheAuloyyibNtAYLd4ztpii3CKK2NULZACmvSsldLuyJOPyFdblW
XuIlmRhdWL/A3HO0rxY6oRuwXB/g3knK5Ligml3KYDaUjqvr3jeQ3Kp3J0nq
GmH9BIgsgTmeTq0LIbJuiaXpc6L2CJq3sBVLgDB6jvEN4R0vyePCKRIZK1nd
qjZjpH72d+TaONrScKnfqWYImCMx1XOO6deywNhjaFB8jzCLjq811s5lpkxd
Dtvztuc6rFdjHXYC4zEi8SuoDhujkUP9p/RZhHbA3biosG+m3LxwKzlOblt6
yVGaSmKt0BaB/IbUbZpW1jII2+EaFrXoC9v8mpBkoOW4E1VZBvvQioloGep7
+4B015W3FQrDIxojT+6uFW5VfSVfT5f11m/OhZ6ZJw0DBXDv1g3LepsMspjR
ezXB3HmnTWLSaqvPvbLtv2xqQctk1cWikWxFdz1QYeFBPwei2uk3gdm5g2Fj
qX9Nn8dEeC1wfhYc1hmsJ3Zqj+/v35nz5rkxtCFQiFvfYtbwniOmGJwvyDAw
4c4gPpHmyPgWdbS2f2p96qZXA7J3rOg7ABSBDAxnmxuCAf18EY0CJptMDhXB
Lx/YPhKZlKatxgaZTLBVqPANvrVnwUWwbWoSaANsPxlBY3YvvlNxUIe2ujSd
8SlqFXoS2BalYQhEIUnnIKhYpwmP/7QBTjcb3/Fz9R7YH4kvH1ovXnbBPXpJ
XU08ULZxEfU214UqmxZBdzn77WcOWLvr4ENS4jXcSsy2+WtYpCe7PPcQHlXQ
kBN0pQZZ/HYt1bi/xw8/+18kGeWqTpvuMULLq88aDPnLz38G77VYlQS6u5cn
wKQvJaMK+H+LESAouNXoD387b1Z38uarTbyxyS9UItyUy3BFCchwU9rBCmcK
giznramAKcFx4Qu2OV6KX37+y2tdwbBffv4PVy1ti3vUOddPPZe2iMUjLV3w
/NHvvnSGYIPWOPN44d2c3db02sv1fZO0tgoMJ8jFW+rW1RgZIUevrv/5ElOZ
HOfYi+D+PeNOhy935mbW77u1kZ29r1JIMapxgS12m8AMkmw5DMZeKVgNYuME
JND2RwS9EbbodNC+Mb52DWvU8XJQ2VxuyZ3TM0rlUymW6r7f0P3PyAmZa7Wg
q1Gc+EbBQI51d9qwdF2HJUwDTggwosGlm3iN+hfS3F745kJWh0gPJyIiWmPW
S3LsOoND8LrU+TtBKPhpui9ZWr2r/RGXUSk11G19eLEBBeNs4U2tLUqXDYah
oKIzoF7bdTK8m9iQ0fE3ZR99yr7YhjS1hbt2SMCdIj/F3xlhc/Wc6OTypQfd
e4Wi66s2fe2MJKfL+Qsb6FvhPidTqvZZ0IyXZOp0H7gMu4xjFuVZXdWFstmp
04MXBwNpqbBDekF2m9+VUQv074trBSAJA+f+FH1EtQFvuC9HGaHEmaJApR4e
sr5XiNZqelBtl9Ap2o2yshJtv6UFN0Qd2zZiRcMQfDdNbNCk2WIU5kQzl1py
cM6aZLp44Zq2AP423fycCIDJyPr5tzUkpfOykgC4u2yypvH6lr5LokRGu8iN
7Y+7oynxG0jGEA7BZsb8FT1CVhVKTAGEQ7zSXLtoPOXgWiziGGqG11OHmEqC
6FlqVjXeHt1fsF8x1Lnoiic3x1ATHbvboxRzY2JCx+Q/FvyVPNhBLNE0lSo0
OcfNB604lNgksnJfWQD/vra3bLE9PZ4rvPKC/4o9PVGTEYozImZqX2QUJ7NV
teAvWcGT8pd8wIkHxjCoTpXmfmSNgT1wxcVf7tuHbEzGtQyX80LbjHnMYpVX
Zl7IfIHKXyPOqawp9z2V62Ef+JIhMirgcfTc2S7OqBe6tEeD39bkKj73xUH0
JjPLBOkn6acrhdzIoOKn92YQQCi8MnhzeLzz31h/9mW+UwAA

-->

</rfc>
