<?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.43 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-czz-rtgwg-elastic-bandwidth-routing-01" category="info" submissionType="IETF" xml:lang="en" version="3">
  <!-- xml2rfc v2v3 conversion 3.34.1 -->
  <front>
    <title>Elastic Bandwidth-aware Routing Framework</title>
    <seriesInfo name="Internet-Draft" value="draft-czz-rtgwg-elastic-bandwidth-routing-01"/>
    <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="October" day="28"/>
    <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 (SR) strict path, 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 (SR) strict path, 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 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>Post-restore Threshold:</dt>
          <dd>
            <t>A configured value, when all traffic is switched back to the primary path and the bandwidth utilization of the local link does not exceed this value, then the traffic fallback is initiated.</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 strict path, 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 strict path 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. It should be noted that the bandwidth information update will not trigger the re-calculation of load-balancing alternate paths.</t>
        <t>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 strict path, 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.</t>
        <t>The conditions for traffic fallback are as follows:</t>
        <ul spacing="normal">
          <li>
            <t>Condition 1: Once all traffic is switched back to the primary path, 
the bandwidth utilization of the primary path does not exceed the 
Post-restore Threshold.</t>
          </li>
          <li>
            <t>Condition 2: Condition 1 is met and sustained for a Restore Period 
(to prevent frequent traffic oscillation). The Restore Period is 
configurable</t>
          </li>
        </ul>
      </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>The Congestion Threshold should be sufficiently far from the Post-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>
          <t>It should be noted that the Minimum Advertisement Interval is used to limit the frequency of bandwidth information advertisement in the worst-case, rather than the real bandwidth information advertisement frequency. The bandwidth information advertisement is determined by multiple factors. In actual deployment, the actual bandwidth information advertisement interval is much longer than the minimum advertisement interval.</t>
        </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 (e.g., BGP-LS for TE metric collection).</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 as long as they can advertise the bandwidth information.</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 destabilize the network. Destabilization 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 303?>

<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+Vce28ct3b/X4C+A2sjiNzsbi3HbRLhOolejnWvbKuS3CAt
ioI7w92lPTOcO5zRev0I8jUKtEA/Sz9KPknPg5zhPPbhpOjFRYUglmaH5OHh
efzOgzsej/f3bCmz+N9kYjJ1JMqiUvt7Oi/oV1s+evjwm4eP9vciWR4Jnc0M
vF9NU22tNlm5ymHIxfnt0/09WSh5JK5NVepsLo7hr/295bz9RPxoijf4xw+F
qfL9vf292ESZTGGSuJCzchy9ezcuyvlyPlaJtKWOxlOgbanjcjEueKLxw8P9
PTO1JlGlskf7e1UeS/5tf6/UZQKTnfNgcVIPlkugr6blaQFrLoEWHJPIDMhU
2f7emyVMIsbNMPrr4ocr+vfSyBjIgdcjmIMeuflwFlmVC1MQEcBSAayyR+LH
iThdKHpZ8DZ/VPrPGhZsnpsCVj9d6EyK52aqE4UPI1NlZbFyH+ATlUqdHIkI
hy3dJN9H+GlKoyaRSduL/2ki/nkhw8X/JJsntOyzSsJcGxd8hwPeyO8X9Gp/
lcveKpf6N66S6C8fP9600HNgJwhdoQppg/UqbXsf0cK3KlEzk+lItha/yaXO
gsUTmCDV80olsKqbI60KnSTm+7Keok/RHyfizIQ7/6NW9ZNdd/5aq0kMYzr7
JkL0tCp7MvXTRPzY4vdPeiaz+tmu6y7h/RWO/PrRWpY/6y71TOqp+eSlCmC3
BW2LJ7jo0GqzKkncZiqLEt6SIJnpd7IEc7PbaiuZTUBNqt5SmSlSmOdOEUfR
loV/j8djIae2LGRU4t+g9oJGJMkKVkvzCoyMKBdKWFB0+L0UuSwXFlglpMhU
ifZEwJzwOHqjSvwVjE4M9mEklhqsQ1WKUpL5w1lgodkMbFQMdGexFfA/Ie9g
C3KaKFGbPZi+NLB+ZnUMgolsgFMBHuEkYNJA9qVIdPYGJpoXMqY3BFFRlFom
/NkM5q3w7ZDW5UJHCxHJytLGwL7OF7BLUai4inCaEc6DtN6ZpEqVMDNhcxVp
JNuTP0vMEnkQgXm3Cs048jRCro1Elam3MKBUMe5gDjxD4lK5EguZ57AHPRMm
A/4OsBXtNVAWE0svrgJ2TvB4QNvvVIbzwR4j+K2QiX4Hr986ws6zuc6UKpDf
B7fnD2CCiHYKFICrm49LVaQBn5H/6GLgjRxsfIbjphIJgAGdwxrVvMtARpBj
IDQCzgn30eyUZMNxGzisU5WsiPjbBRwbuD5galbCpDYCXVd4krG2rPewLvLB
SR6fKpKYgBcStRcSqYpAU8B+kYbGWz3fwfnJ9YOQfDgodafBgbboZlrFFGwf
DL49FzMNiyycAswTAxQIk8NrTjUn4qLEuVAYQHPGKkMxjoE7sDu33ExG4SrI
r2a7NYvBnzkN6QqE233jg2FBOMQMiedXnBCLGzUnzta7vrl+IHCliCdjhRRg
G+aLEk5CoSyAtMTBiS9CJYRpErfTtYoK2gGDrKOFGJIX5k4jA4DRCnengaqR
kFFUFUg1TjUFa4GCTScNK+CkoByFkcgykP14BUcLjCFFDtgn74yOgRFqIrz9
SnUcI4DY37svLkAljFPkT7BnfwlzdpzgdHBuSCMIm3pbqsySIJJIoaTI+E6B
QQP2Eh+aCQtAiqgttT0H1sAe6C1AtshlPxRlAnTXVtGi/bolLSZrM10RFbzx
tv79Drt7oCbziZhWGRwP6Gw6VUXrhQdIMrLxr8E24943WOZjsgBCl1YlM3ix
IomLjbJtW9k5R7RjczTPRWiJRrA8LJcqmdmOdUXtAtlKBShTASeLYg16RjRP
gWST3PF5gkACDSAGryGeIbvAx8EPvAATOalCI/EAifAnQUjMgJUsxmwcPHdt
yd5lBFuyVUITafYt4sBve1aYFNQyY2UzAuS8sA9gRGRAKFdkaNmyyWKuBDzO
DCm7sXDyzE+vHX5h1fVsJTiBzCRmjmdnYfNwesBUtOCxyhOzIvWoPdGI9gt6
FjpaJjcv1BjkI6pYp6Z8+rAQbNE6Yw68kS2P23Bonfks1J8rXbD+0W7x42Hr
EGrBRDwzSwV8clIwoLMyWcqVRbpjMO44Gzo32H8o3k6ynFwfKI0q7NcaNOXF
+g2A94xC7AF8DPgPEvh5Gw+A4nkC/h8jAPD9uPjv8/4d6fwrAwPIazLfiuer
iljxBKCkKoM/opVfLFSpFY/ydkpnd2jZaEuwijuJ23MSq/v3xXWoa5cgeJWc
KxY5Jd6olcBIzIp7z1/d3N4b8b/ixUv6/fr8H19dXJ+f4e83z44vL+tf9twb
N89evro8a35rRp6+fP78/MUZD4anovVo797z45/gE9zuvZdXtxcvXxxf3mMd
DDUBJRUkY4r7hHOAE8eTlnbPqwhZspPTq//+r8PH4v37v7l+evro8PCbjx/d
H18ffvUY/kAbwKuRP+A/gX2rPTQCkrQfhBUOJdelTMAmguEEkVtmAt37ZG/v
b/8FOfOvR+IP0yg/fPyte4Abbj30PGs9JJ71n/QGMxMHHg0sU3Oz9bzD6Ta9
xz+1/vZ8Dx7+4Tvwe0qMD7/+7ts9J0G3JP9kz/BJO++FYM2p2RWINoTOR8Ej
l6NzGliDBK/dHdO1dHAKFFunEryhRxfOTKjYh3reaNwuwBEtTBIfCVoY35zp
OSCoWNzJpPLWf73CgsoAbjORR2jqbaRUbFkM3RSln6IGtd5QOc8DprDUZIMa
e9Xaw/ZYhXZ2ZWw5hh2VZGPrvW3cGkqtpwtIsWC8ooXiOMKHoD1aNvKD0E/D
kRqpMWs2c2YG5NDKIVcmLDY4IwoPuCLPhBfgDMTB5eXJiwe8y0yAO2p8hcNc
6DO8i8pVgV7frhOiKoddoNGOyo6Hof8IGQMWDXbIvL8vXoF5PgUTb/FPIENI
nRJIazxiDQyDaQmUEzYKMIa6I3vrPLxAW1uucsTaqAUwBnE8IPGkitH0s6FD
JifgQHECD4hDH9ys1As0KHIEKFl6tnjzHyjLaT38EoefNcNpw281g18E6wCl
SxOZBNd0/nXICYe6HMaDuuzjfB/jMciKysrLVzvlEgoTxsTWu0A+KXGMmAjn
ArcGHlKNutGKwWCaVaOOWl3UxbicsjBg5wGBlKsmgMJ1mkAXV5ugOKq3Ms2T
JhArTc7ITnv/ALO9f1+o2bg0Y1DQw48fifc///wz/vPFGH++EPgTgXo/ORT8
0/vgkeh8sr/3QYDeiw9Pej/wwcngB/jJKXzSXrj1s/aD5hNMn4oPHzofeyp7
H/ifDx+GB25Zth74xRcDG8IdnQ3v9cmTL8L5aI6A1C83Le43Ux/V+yNxPzhF
QaWjJ/c2iMC9jw5GgWih+s4glnPw9ngkTkbilBHHWSeMGQGcKZcYlCnM6eRS
F97sQggqMZTiacC+Lg0A7akqOCybmgrxpSU75rIHLKm3vaCcIs1jtCOnKKvH
429Pxt+eBiGUs4W4rFvCk3VMZJ/gsGlh3sCTuCIY1jNwI7JdocVoFB4MdaT0
nWKHwTEPLEFGrDGknJIBHc7QYN+hSjYmg8bQ5rKBtENnh2ACwBW6fY56xmTw
bWe00HFTnF5zaUcz4zmGx+XZNhIWDHuwxcbA1dE4436yxQuZzFqBrRenbvwS
buAACD0DQmlF/h3pruM4l2gUILYZcBRBTj8ogV0G0SIG0ODe2fWEkdhiKBob
RBS9iMtgatOkqYllZ6a4onRFKynGsZPRccdp906eE5zrnNsJuUGX9qeECcgS
Bvhej3Uvc9Q4VvKhNbagIiJ5LR9tWYip+75AWtGKR7r+4BPU8weVqYIzcm2Q
5oEZcaweTEqKzgxPFl6JZFGsujnY4PWepKEsU3YsVW0A0aLQ6T+91Uc5B5RB
lU5lIlWUnBSaGVNOEZ+mEjDpg75ONmB7Td5lxvs9Hp/srJIBXNi48f8TFRtS
gTaXh4T+L6mYTN2nqqJ4CZy902qJfADo3E9pAbtyYymjlcFrzfYw/YxpKsDb
YXUjLGw4+E2cwfcwFTBncIiuh9I1N9ftHA5lnrwitOI1VKTtbEsxg4vWYktW
qZUTIpeX+1V6BRqq7jSpzSZ56XR7CdFekOx0OSI1m5FrxPRbOxIZtGCxhvcL
whDOTLGWTnxUQ0AcjRysSpAlla+B8RBe59w0czgRzw3EboasHolCWDGptza4
lyNxjqBmXRQnUp55vc63udQJTTuB26hNHU/K/T/49uaiECgB+wWGbJV1wQ8x
6tGk09/TOfg6Ltphy3UIBdJi0Cb0nMEupUxQ2aaiE+OxZ04lbknD53Bc5SIl
JdoyFyxeJVi4WOG0b5TK19DEmYCNc4FqvTagkGwIvpzU9faWzlFQ3ojrkXiJ
CEkKjPxdsI6HJ8vNmYkwfMfzbzmQobQQhaJLRHoDuWVQNztQygL9YlJIyF0G
ZVcr8CoD7wTieQrhhXjubQhmxsTBq9PnVw9cLqAXNHMbwi7HNlXNcm2rR0JC
VjuYNzEmt7wqp7SRgxR4bFwOObEu9f3Jaku2kRPfKCWPGynx+aIjrqUSwAA5
iTVnPNBJp8oV6EZrFojBtSCupsowrHTdTaA9GNVnGCSKKAgweY7gH61IO49W
IFYogzxaB741NU7nAdG0XhUGUD1gWesAaseOHnftKCVi6sqMuGjME6XMUDsy
FnAqkoPOV6ay4AicGf1tlQjUH1OVHE26vMrt2okcXMZSQWg+yVk7AXHJW7Km
rgreytrS7P7lMO/a8ZBc+LCcivH5TqJ/SLkb3Pn1w89G4hv8nyqjSauaNVVh
4hT8ozfNJsd+A8SpgIRYVZyuB5VeJ4d8xriJBreQv0UfMi2l3pRh7jj6VrZZ
00FQsT4CglhXAthEvuhVTrahHtQwbBRYWaTfYzh4LU5WnLps2xDEyYmSRDni
sBDeIXwunCliz9jIRkF1PzKneLJFFWFPQ3v74UbllPpBfouxYNtE3OlUf39E
oNft1mDdXsCeQHToyAdM/e83X+xvTJ2zQYxJgQSIFNlcjzWZjRig4NA2jyde
jHqAahgXOgGGFbW6o9R7UffFtKYAXOzTt7fnrmshbJuBg4Ix2D5TAKNWro1G
Mj5pddN069x93MTNEql8q9Mq7SDB0RBzGaUxT1UcPidtbXv0g4ub8cXN+/ff
Ye3u7796+PHjSLy8uXrKT756/BXE086JtrqGOBk9zMY2t6kywb1QPlpvvTBu
z+vSuWDMNxa+xGkDCP0pb/Hnmood7cbGT6+INd1SZQsHtqYcpCKAsMQUTI4g
A+jJ2GNN0nkHPVKlWKlnxodXYSuHjx522HuDZdrtJeTyNB2ZpCSacbIKq6Af
LvR8ztkYjEIGmDVoJz2YiXwx6pGToIADfovyjWqQ6JZdeIzcjh4LVaNidE6p
c1IQ/lrs5muQ8iao21hBl6HxUgl8csmzsr2DUQP/OJZhhaLoeAHAb81as1aD
VW0xzWyGm68BDmC2M/LOzkFYjPfhgLCnjDHKyDkNtj7MHCS6xH7v0q7fR7CH
2kBmFfXEob/sBhwNRnAxMKOEGvR0s3MUSDfylhkqr/VjjdBiuBiSIgfMRDu5
oxFB04kP9LdXdvsxWj0HYfTNhmIXlICFend2Z2HoReihgU/46nDwtVvc1caN
OwRgA8i7AVHE4Kny/O3nuLYnanZgPgZejOkx54WtNd11uDMyWAXHMu2doGkg
NuoByN8cH7lYfhi1y3rtDenSOvVJak9RPXb4YtwyOIKVCJvXipCEzWYppGMN
VGrMDi4dvkSNzgPr1oK5E9ObwL4pFIkqS6gtsYW5OIj01r9VTd5Vd7sZDVee
36y0XrSbEtOaqN1HK4DVMHJsZ2PD8b7LmiN66vEWT8GS3FyPn19d3jTlRe7Q
bkgAMCpz65wsHQz2xRZshBPYFTKCpgD5UInvzy9UDvQgZNrqCl3LuSPn7h8+
lRbgKbYOw0AC8pikN3OOJ/07N9fPfFgHgTBeISKybi7OeAs1tXUD73aCr0yC
Pfi1b6oxUzuwxUXneEORc6ZkK1xGoq377tSiRFqwHhdYFVUz/RYruQx1GzeU
aspgx1xz6Fm2ndJOdR3MS+hTl00JpbbuyOGeaWf23fItYduegVrXU4RGQ2PX
rYlQAV0Hk21F024YeMC5xj5ZKvw2gXWQ9Gl1lXjqqVxjHfBkpDlGj8ODxKFP
KX5iN9QICNjo+non02+HUmJd59akS+ajo5BmQZ3sXG2xlUWhdvIn6yTWFaBd
E8MKB0B9XlAuH2SGamBNFcnYCPSLiHbBUWc8rESXCOuMiivb5C7MoZRlGPY4
yXrZTCxuqhxVzDoU8VxHhRm3q1lA+iyReU6Xpfq3G1DNuP5f78CZ7tB1dLNY
AToloeF4Eufihh6MFwIGUNpgIAnNfGkil3CIbbaGesKGuFHWEoKCzMncYCqr
U+VhQWjFFa32J9wGhusYqgAD8IohHBM+sO1kQEsY7yi7lvOBIsN0CryAZRY0
bX3XYU0WCusHmMPkTto7mXijfbsGuwUMsJW/rYR3GGTRWK1hwW9Cke7BuEP+
3HaPtQr72wi0BPdWKuwXqwMEkMvjpiaIrLhysZV4Ab6/2YutofcaRNZR9m3h
XtEKX9bIWe3Pg7od93uwQeQ4ENblqrHFOx4xmpd+qbVn739c6IRubXKinLsI
KaXho0uObAbTgnRmXS+zZcuNxnayhTOXfA4zAdICcwI1WQdks26tobap1CjA
UZar4YEn1XMyi2j3g2yHB/UkMk6yunVedtX9NOjINzQ0xVKr36l6CFgYMdVz
Dm7XssC4Y6ixZG9jzv7faKwmy0yZyg6KTNBA3K7gYmVyAuPRtYU1RQ/R0G6h
SlMeKULV9ncHSuwgsdsXbiTHy22zXwIHppRYPXPVkLA1c5f2jbUMwsawmkW3
dUcGNrzV4eFA820H2zsGU+3IIRveRMPQEOG0tu7703YpPEo8ojHyZHPRbKd6
JF2yobtm64nzAVAWSMNASTi4P8Ky3mRFOD0YvppgErnTODBptDXknm06Eeui
yDJZBfNyhk02oju8D7rOQsKDrgtEtdOBAbNzTX9r8XtN58NEBM1gYToY1hks
rHWKcO/vb0z+8tyIsDkBBKTvMGv7mh4Gut4XZIiPuUeGT6Q+Mr4EHK3tJFqf
QOgVQ9xtIbq3rgg3YFRVX3Br7Z/vURFud1nVrVkxmVjTlCVbKT2wVajwdaLF
nQVXg3ZJzqMNcJ1VcR/v3y5UjV6I1KXpjE9Rq9CTAFmUDCBchFt6DoKKBYv2
8V/UWOh26zth0jpA0iPx5UPnxW03y4ReUpceaF3MdqAEbEiuC2Xrbjl/ufjt
Zx4s++vMQ2IS9J5KTPqEa7j7GrLL9ADnUS0JWUEXPJDHb9duG+l79PCzNXv+
39gyClaV1g1VhIBXn9Ug8tdf/h3c12JlCUh37xGATV9KhhWc89W+lAKGBB3i
7+fNaiNvvtrGG5eEEUFkR+qbgBDXRQ6s9aUgyXLe2AqYEjwXvuD6xKX49Zf/
eK1LGPbrL//p64ZNmYty4P0MqHXlHB7p9gXPD//uS28JtqgNfZPAhvT6loP3
+I1uu6TaFZc4NmRTuFNFj7kC6AhiEQTF7aiIOdaSkPVz1Yt3E6EbC4php8yq
6R2cASYDoiZ41O7KC1/AriXOP95tmw3XqKiELevhJlPH7OFhE+/LXga3dHf1
k+4if99/rD0iOBQuOVOTscbIFKX/+uafrsa35y4Z6i6dh3eaO43J3FCcOZDm
10bR731tQ4ohqE8sYI8MzCDJ8cJgbPWC1WSeJ2AtXFfHbdjR4Uplx80b4xvf
b0d9OselS/9abvie0XlTAZmq1d/QtdPIa0JfsCtUYuRYl9KapesaRGEaQAwA
6A0uXQfX1HWR5u5yOZffOpsMQD3C1zVyZgmF6Qy/UsJlNk9+uBpf3tCZNS0F
Ed5BjlyaqcZd/D0lFNHWTaZsgYKvG4i4SEyXwrqNHS+2hDY4W/si2g6F2RqY
UqTYGVCt7akZpiY25EhCotyjT6GL/UJdtthEIUVjFM4r/h4LVwfgJCoXZ4N4
rFeDurluUuPe8blUvLT8pRTSNrOvawAJpIS/fIK+1u5zcqvqiAXZBEnETk+G
z/rLOGZVmVVlVSiair6U5vjF8UDisd06viAvzu/KqIn77osbBZgZ8yj9KfoA
e4uJ9V/1MkJZNUWBZmN4yPoeKlqrbtJ13VMXaJlsGVh+V1mkVnbnANH0tL5p
JzZoNF2FLMG7pT556NG9c9B0I8U3s0E0VF9z4LwQTEb2NbzGIilhm1mKx/wt
nDWd6Xf0zRgWGe0DebZw/vKqxO9TGUN0DMSM+QuHhCxLlLUCNg7ha30fpcZN
g2uxcmDmoX1vd4ipJIqBL2AlZfKoUuC+MKlzAxhPbo6ZB5R4T6MUc2NiCpbI
2i34C4awxVpOqWepbazO6g8acbDYPLPy38UA/75214+xfz+eK7wLhP+KAz1R
YFwzDqCorZMxvcxW5YK/MgZPKlzyAeehGNGiQgG4YNOPeR7gig/H/XcpuRCd
Kyw+BYrWHzPVxSovzbyQ+QLNRoWot3TOIvSFvsl/4CuTyGCAT9Nzb/UgvoNd
F9q6o8HvnvJ1qPviOHqTmWWC+yfpp7uW3OCh4if3ZhBPKrxLeXtyhgP+B5wx
rQuEVAAA

-->

</rfc>
