<?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.31 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-lsvr-bgp-spf-te-01" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="BGP-SPF TE">Applying BGP-LS Traffic Engineering Extensions to BGP-LS-SPF</title>
    <seriesInfo name="Internet-Draft" value="draft-li-lsvr-bgp-spf-te-01"/>
    <author initials="L." surname="Zhang" fullname="Li Zhang">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>No. 156 Beiqing Road</street>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>zhangli344@huawei.com</email>
      </address>
    </author>
    <author initials="J." surname="Dong" fullname="Jie Dong">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>No. 156 Beiqing Road</street>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>jie.dong@huawei.com</email>
      </address>
    </author>
    <date year="2026" month="February" day="28"/>
    <area>Routing</area>
    <workgroup>LSVR working group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 42?>

<t>This documents propose to introduce the BGP Link-State (BGP-LS) extensions for Traffic Engineering (TE) to the BGP-LS-SPF SAFI.</t>
    </abstract>
  </front>
  <middle>
    <?line 47?>

<section anchor="intro">
      <name>Introduction</name>
      <t><xref target="I-D.ietf-lsvr-bgp-spf"/> extends BGP for Link-State (LS) distribution and the Shortest Path First (SPF) algorithm based
calculation. BGP-LS-SPF leverages the mechanisms of both BGP protocol <xref target="RFC4271"/> and BGP-LS protocol extensions
<xref target="RFC9552"/>, with the extensions to BGP-LS attribute and new NLRI selection rules.</t>
      <t>BGP-LS-SPF may be applied to network scenarios beyond data center (Such as WAN). In some network scenarios, traffic engineering
is necessary to improve the resource utilization rate and load balancing.
This document proposes to introduce the BGP Link-State (BGP-LS) extensions for Traffic Engineering (TE) to the BGP-LS-SPF SAFI,
and discusses which TE extensions can be applied to BGP-LS-SPF SAFI.</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>
    <section anchor="link-attribute-tlvs-for-te-metric-extensions">
      <name>Link Attribute TLVs for TE Metric Extensions</name>
      <t><xref section="5.3.2" sectionFormat="of" target="RFC9552"/> defines the Link Attributes TLV for BGP-LS, which includes the basic TE attributes TLV.
Furthermore, <xref target="RFC8571"/> extends the link attribute TLVs for TE, and newly defines 7 TE link attribute TLVs. The TE link
attribute TLVs that can be applied to BGP-LS-SPF are shown as follows:</t>
      <table anchor="ref-to-tab1">
        <name>BGP-LS link attribute TLVs for TE metric extensions</name>
        <thead>
          <tr>
            <th align="left">Type</th>
            <th align="left">Description</th>
            <th align="left">Reference</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">1088</td>
            <td align="left">Administrative group(color)</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1089</td>
            <td align="left">Maximum link bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1090</td>
            <td align="left">Max.reservable link bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1091</td>
            <td align="left">Unreserved bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1092</td>
            <td align="left">TE Default Metric</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1093</td>
            <td align="left">Link Protection Type</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1096</td>
            <td align="left">Shared Risk Link Group</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1114</td>
            <td align="left">Unidirectional Link Delay</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1115</td>
            <td align="left">Min/Max Unidirectional Link Delay</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1116</td>
            <td align="left">Unidirectional Delay Variation</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1117</td>
            <td align="left">Unidirectional Link Loss</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1118</td>
            <td align="left">Unidirectional Residual Bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1119</td>
            <td align="left">Unidirectional Available Bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
          <tr>
            <td align="left">1120</td>
            <td align="left">Unidirectional Utilized Bandwidth</td>
            <td align="left">RFC 9552</td>
          </tr>
        </tbody>
      </table>
      <section anchor="administrative-groupcolor">
        <name>Administrative group(color)</name>
        <t>The administrative group sub-TLV contains a 4-octet bit mask assigned by the network administrator.
The format of administrative group TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig1">
          <name>Format of administrative group TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1088          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                            Bit mask                           |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>where:</t>
        <t>Bit mask: 32-bit length, each set bit corresponds to one administrative group assigned to the interface.
The least significant bit is referred to as ‘group 0’, and the most significant bit is referred to as ‘group 31’.</t>
      </section>
      <section anchor="maximum-link-bandwidth">
        <name>Maximum Link Bandwidth</name>
        <t>The maximum link bandwidth TLV describes the maximum bandwidth that can be used on this link in this direction
This is useful for traffic engineering.
The format of maximum link bandwidth TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig2">
          <name>Format of maximum link bandwidth TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1089          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Maximum link bandwidth                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>where:</t>
        <t>Maximum link bandwidth: 32-bit length, it is encoded in 32 bits in IEEE floating point format.
The units are bytes per second.</t>
      </section>
      <section anchor="maxreservable-link-bandwidth">
        <name>Max.reservable link bandwidth</name>
        <t>The max.reservable link bandwidth TLV describes the maximum amount of bandwidth that can be reserved in this direction on this link.
For oversubscription purposes, this can be greater than the bandwidth of the link.
The format of max.reservable link bandwidth TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig3">
          <name>Format of Max.reservable link bandwidth TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1090          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|              Maximum reservable link bandwidth                |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>where:</t>
        <t>Maximum reservable link bandwidth: 32-bit length, it is encoded in 32 bits in IEEE floating point format.
The units are bytes per second.</t>
      </section>
      <section anchor="unreserved-bandwidth">
        <name>Unreserved bandwidth</name>
        <t>The unreserved bandwidth TLV describes the amount of bandwidth reservable in this direction on this link.
For oversubscription purposes, this can be greater than the bandwidth of the link.
The format of unreserved bandwidth TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig4">
          <name>Format of unreserved bandwidth TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1091          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(0)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(1)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(2)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(3)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(4)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(5)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(6)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Unreserved bandwidth(7)                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>where:</t>
        <t>Unreserved bandwidth (0-8): 32-bit length for each, each is encoded in 32 bits in IEEE floating point format.
The units are bytes per second.
The values correspond to the bandwidth that can be reserved with a setup priority of 0 through 7, arranged
in increasing order with priority 0 occurring at the start of the TLV, and priority 7 at the end of the TLV.</t>
        <t>For stability reasons, rapid changes in the values in this TLV <bcp14>SHOULD NOT</bcp14> cause rapid generation of BGP update messages.</t>
      </section>
      <section anchor="te-default-metric">
        <name>TE Default Metric</name>
        <t>The TE Default Metric TLV describes the Traffic Engineering metric for this link. This metric is administratively
assigned and can be used to present a differently weighted topology to traffic engineering SPF calculations.
The format of TE Default Metric TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig5">
          <name>Format of TE Default Metric TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1091          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                       TE default metric                       |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

]]></artwork>
        </figure>
        <t>where:</t>
        <t>TE default metric: 32-bit length metric value.</t>
      </section>
      <section anchor="link-protection-type">
        <name>Link Protection Type</name>
        <t>The link protection type TLV describes the protection capabilities of the link.</t>
        <t>The format of Link Protection Type TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig6">
          <name>Format of Link Protection Type TLV</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|            Type=1093          |          Length               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|Protection Cap |
+-+-+-+-+-+-+-+-+

]]></artwork>
        </figure>
        <t>where:</t>
        <t>Protection Cap: 8-bit length, indicates the protection capabilities of the link, for the detailed description, see <xref section="1.2" sectionFormat="of" target="RFC5307"/>.</t>
      </section>
      <section anchor="shared-risk-link-group">
        <name>Shared Risk Link Group</name>
        <t>The Shared Risk Link Group (SRLG) TLV carries the Shared Risk Link Group information. The format of Shared Risk Link Group TLV of BGP-LS-SPF
is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig7">
          <name>Format of Shared Risk Link Group TLV</name>
          <artwork><![CDATA[
  0                   1                   2                   3
   0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  |           Type=1096           |             Length            |
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  |                  Shared Risk Link Group Value                 |
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  //                         ............                        //
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  |                  Shared Risk Link Group Value                 |
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

]]></artwork>
        </figure>
        <t>where:</t>
        <t>Shared Risk Link Group Value: variable, consisting of a (variable) list of SRLG values, where each element in the list has 4 octets length.</t>
      </section>
      <section anchor="unidirectional-link-delay">
        <name>Unidirectional Link Delay</name>
        <t>This TLV describes the average link delay between two directly connected BGP-LS-SPF neighbors.
The format of Unidirectional Link Delay TLV of BGP-LS-SPF is consistent with that in BGP-LS. The format of it is shown as follow:</t>
        <figure anchor="ref-to-fig8">
          <name>Format of Unidirectional Link Delay TLV</name>
          <artwork><![CDATA[
  0                   1                   2                   3
   0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  |           Type=1114           |             Length            |
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
  |A| Reserved    |                      Delay                    |
  +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

]]></artwork>
        </figure>
        <t>where:</t>
        <t>A bit: This field represents the Anomalous (A) bit. For detail, see <xref section="4.1" sectionFormat="of" target="RFC8750"/>.</t>
        <t>Delay: 24-bit field indicates the average link delay over a configurable interval in microseconds, encoded as an integer value.</t>
      </section>
      <section anchor="minmax-unidirectional-link-delay">
        <name>Min/Max Unidirectional Link Delay</name>
        <t>The Min/Max Unidirectional Link Delay TLV indicates the minimum and maximum delay values between two directly
connected BGP-LS-SPF neighbors.  The semantics and values of the fields in the TLV are the same as that described
in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig9">
          <name>Format of Min/Max Unidirectional Link Delay TLV</name>
          <artwork><![CDATA[
  0                   1                   2                   3
  0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
 |   Type=1115                   |           Length              |
 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
 |A| RESERVED    |                   Min Delay                   |
 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
 |   RESERVED    |                   Max Delay                   |
 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="unidirectional-delay-variation">
        <name>Unidirectional Delay Variation</name>
        <t>The Unidirectional Delay Variation describes the average link delay variation between two directly connected BGP-LS-SPF neighbors.
The semantics and values of the fields in the TLV are the same as that described in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig10">
          <name>Format of Unidirectional Delay Variation TLV</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |   Type=1116                   |           Length              |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |  RESERVED     |               Delay Variation                 |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="unidirectional-link-loss">
        <name>Unidirectional Link Loss</name>
        <t>This TLV describes the loss (as a packet percentage) between two directly connected BGP-LS-SPF neighbors. The semantics and values
of the fields in the TLV are the same as that described in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig11">
          <name>Format of Unidirectional Link Loss TLV</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |   Type = 1117                 |           Length              |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |A|  RESERVED   |                  Link Loss                    |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="unidirectional-residual-bandwidth">
        <name>Unidirectional Residual Bandwidth</name>
        <t>This TLV advertises the residual bandwidth between two directly connected BGP-LS-SPF neighbors.
The semantics and values of the fields in the TLV are the same as that described in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig12">
          <name>Format of Unidirectional Residual Bandwidth TLV</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |   Type = 1118                 |           Length              |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                          Residual Bandwidth                   |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="unidirectional-available-bandwidth">
        <name>Unidirectional Available Bandwidth</name>
        <t>This TLV advertises the available bandwidth between two directly connected BGP-LS-SPF neighbors.
The semantics and values of the fields in the TLV are the same as that described in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig13">
          <name>Format of Unidirectional Residual Bandwidth TLV</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |   Type = 1119                 |           Length              |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                      Available Bandwidth                      |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="unidirectional-utilized-bandwidth">
        <name>Unidirectional Utilized Bandwidth</name>
        <t>This TLV advertises the bandwidth utilization between two directly connected BGP-LS-SPF neighbors.
The semantics and values of the fields in the TLV are the same as that described in <xref target="RFC8570"/> and <xref target="RFC7471"/>.</t>
        <figure anchor="ref-to-fig14">
          <name>Format of Unidirectional Utilized Bandwidth TLV</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |   Type = 1120                 |           Length              |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                     Utilized Bandwidth                        |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document introduces no additional security vulnerabilities in addition to the ones as described in <xref target="RFC9552"/> and <xref target="RFC8571"/>.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
    <section anchor="acknowledgements">
      <name>Acknowledgements</name>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="I-D.ietf-lsvr-bgp-spf" target="https://datatracker.ietf.org/doc/html/draft-ietf-lsvr-bgp-spf-51" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-lsvr-bgp-spf.xml">
          <front>
            <title>BGP Link-State Shortest Path First (SPF) Routing</title>
            <author fullname="Keyur Patel" initials="K." surname="Patel">
              <organization>Arrcus, Inc.</organization>
            </author>
            <author fullname="Acee Lindem" initials="A." surname="Lindem">
              <organization>LabN Consulting, LLC</organization>
            </author>
            <author fullname="Shawn Zandi" initials="S." surname="Zandi">
              <organization>LinkedIn</organization>
            </author>
            <author fullname="Wim Henderickx" initials="W." surname="Henderickx">
              <organization>Nokia</organization>
            </author>
            <date day="23" month="January" year="2025"/>
            <abstract>
              <t>Many Massively Scaled Data Centers (MSDCs) have converged on simplified L3 (Layer 3) routing. Furthermore, requirements for operational simplicity has led many of these MSDCs to converge on BGP as their single routing protocol for both their fabric routing and their Data Center Interconnect (DCI) routing. This document describes extensions to BGP to use BGP Link-State distribution and the Shortest Path First (SPF) algorithm. In doing this, it allows BGP to be efficiently used as both the underlay protocol and the overlay protocol in MSDCs.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-lsvr-bgp-spf-51"/>
        </reference>
        <reference anchor="RFC4271" target="https://www.rfc-editor.org/info/rfc4271" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4271.xml">
          <front>
            <title>A Border Gateway Protocol 4 (BGP-4)</title>
            <author fullname="Y. Rekhter" initials="Y." role="editor" surname="Rekhter"/>
            <author fullname="T. Li" initials="T." role="editor" surname="Li"/>
            <author fullname="S. Hares" initials="S." role="editor" surname="Hares"/>
            <date month="January" year="2006"/>
            <abstract>
              <t>This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol.</t>
              <t>The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems. This network reachability information includes information on the list of Autonomous Systems (ASes) that reachability information traverses. This information is sufficient for constructing a graph of AS connectivity for this reachability from which routing loops may be pruned, and, at the AS level, some policy decisions may be enforced.</t>
              <t>BGP-4 provides a set of mechanisms for supporting Classless Inter-Domain Routing (CIDR). These mechanisms include support for advertising a set of destinations as an IP prefix, and eliminating the concept of network "class" within BGP. BGP-4 also introduces mechanisms that allow aggregation of routes, including aggregation of AS paths.</t>
              <t>This document obsoletes RFC 1771. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4271"/>
          <seriesInfo name="DOI" value="10.17487/RFC4271"/>
        </reference>
        <reference anchor="RFC9552" target="https://www.rfc-editor.org/info/rfc9552" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9552.xml">
          <front>
            <title>Distribution of Link-State and Traffic Engineering Information Using BGP</title>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <date month="December" year="2023"/>
            <abstract>
              <t>In many environments, a component external to a network is called upon to perform computations based on the network topology and the current state of the connections within the network, including Traffic Engineering (TE) information. This is information typically distributed by IGP routing protocols within the network.</t>
              <t>This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism applies to physical and virtual (e.g., tunnel) IGP links. The mechanism described is subject to policy control.</t>
              <t>Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs).</t>
              <t>This document obsoletes RFC 7752 by completely replacing that document. It makes some small changes and clarifications to the previous specification. This document also obsoletes RFC 9029 by incorporating the updates that it made to RFC 7752.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9552"/>
          <seriesInfo name="DOI" value="10.17487/RFC9552"/>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <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" target="https://www.rfc-editor.org/info/rfc8174" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
          <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="RFC8571" target="https://www.rfc-editor.org/info/rfc8571" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8571.xml">
          <front>
            <title>BGP - Link State (BGP-LS) Advertisement of IGP Traffic Engineering Performance Metric Extensions</title>
            <author fullname="L. Ginsberg" initials="L." role="editor" surname="Ginsberg"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <date month="March" year="2019"/>
            <abstract>
              <t>This document defines new BGP - Link State (BGP-LS) TLVs in order to carry the IGP Traffic Engineering Metric Extensions defined in the IS-IS and OSPF protocols.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8571"/>
          <seriesInfo name="DOI" value="10.17487/RFC8571"/>
        </reference>
        <reference anchor="RFC5307" target="https://www.rfc-editor.org/info/rfc5307" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5307.xml">
          <front>
            <title>IS-IS Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)</title>
            <author fullname="K. Kompella" initials="K." role="editor" surname="Kompella"/>
            <author fullname="Y. Rekhter" initials="Y." role="editor" surname="Rekhter"/>
            <date month="October" year="2008"/>
            <abstract>
              <t>This document specifies encoding of extensions to the IS-IS routing protocol in support of Generalized Multi-Protocol Label Switching (GMPLS). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5307"/>
          <seriesInfo name="DOI" value="10.17487/RFC5307"/>
        </reference>
        <reference anchor="RFC8750" target="https://www.rfc-editor.org/info/rfc8750" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8750.xml">
          <front>
            <title>Implicit Initialization Vector (IV) for Counter-Based Ciphers in Encapsulating Security Payload (ESP)</title>
            <author fullname="D. Migault" initials="D." surname="Migault"/>
            <author fullname="T. Guggemos" initials="T." surname="Guggemos"/>
            <author fullname="Y. Nir" initials="Y." surname="Nir"/>
            <date month="March" year="2020"/>
            <abstract>
              <t>Encapsulating Security Payload (ESP) sends an initialization vector (IV) in each packet. The size of the IV depends on the applied transform and is usually 8 or 16 octets for the transforms defined at the time this document was written. When used with IPsec, some algorithms, such as AES-GCM, AES-CCM, and ChaCha20-Poly1305, take the IV to generate a nonce that is used as an input parameter for encrypting and decrypting. This IV must be unique but can be predictable. As a result, the value provided in the ESP Sequence Number (SN) can be used instead to generate the nonce. This avoids sending the IV itself and saves 8 octets per packet in the case of AES-GCM, AES-CCM, and ChaCha20-Poly1305. This document describes how to do this.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8750"/>
          <seriesInfo name="DOI" value="10.17487/RFC8750"/>
        </reference>
        <reference anchor="RFC8570" target="https://www.rfc-editor.org/info/rfc8570" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8570.xml">
          <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" target="https://www.rfc-editor.org/info/rfc7471" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7471.xml">
          <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>
      </references>
    </references>
    <?line 404?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1c3XLbNha+14zeAZvc2LuSIsnyn6Y/q9hy6o7jZC0nO92d
vYBISEJDESxA2nUTd/oYu3f7LPsofZI9BwApUgSlJpFdT8dMZkyCOMABcL7v
HPxQzWazXot5HLA+GURRcMPDKXn+4nXzbEQuJZ1MuEeG4ZSHjEl8NfwxZqHi
IlQkFjZjc/T6pF6j47FkV32dBgnkcliv+cIL6RyK9qGouBnwZqCuZHM8jZoq
mjRj1mx36jUxViJgMVP9ei2JfGru8C/88eDPVMibPlGxX6+pZDznChW4vImg
4NPhJdRdr/FI9kksExV32+3Ddhf0kYz2yYVIYtC7XrsW8t1UiiTqk7PR2wuC
z9ggnVavvWM3kOJDgWHMZMji5jGqjEXTJJ4JCapATxEeKiigRf4xo1gqMc07
41mCkFMa8p9oDCr2yTcJvWacXDJvFopATDlTkIfNKQ/65CcUCfhOr/fXmc7X
8sQcXqtYMhb3yblokc7uHnnO+A+o6oWg0APE4zH0BiR+rxtGPJGEMXbQ0YyH
FDXOFP22RY5FTs9vOUsTPkLP7zlr+SC1YS3rtVDIOShwheMMQxhOCs+tVks3
ptkkdAy1UU8Px+WMKwKGlcxZGCsSSREJxdAaOVQg/MSDhxlDO4RxCd81RzGY
ENkytrpN2MKCoT6nkW9dDrexQFuMNXEyGpyctozmqNSc+37A8OkpWo2uGnuT
vH+qNbnFV+/f/+m0edziLJ4UbP/21ijiK60oapJXFhX1OTSajxNdJg19rc4I
TBHwEZPXNJ6REy7hdguU2yY0AJjweDYnY6qYj8gJvCTQA9zKNyNgV0zSKVO6
wDkMORiCmisiJmQsoFRUCLo1Fp4ICDTg4uSo193vgMqohSWHLMOiP3VrIfPh
7m739rZBrkEbXQdzkAahsWkd06WG7Jqcn12cEsUCZrpRJgFTur9zys/pDRmD
CFAVZz4WB1hFLBPlsZBKLhS8vxFQJBAIJZAIeIYuSrwZoYr8fXC+3YLhIkrM
WVm2ARxi7IEt7AFMU0FWjylF5Y22tDk0/8rYmWRKJBKMDgYqsIAiktp2BYAG
GJCAhh6U1Foy39R61X2ZbwPoDLuGKy9RWO/1jEPHXA7z5Xo0XOpjFwiePiUX
7IeES2aAeAZkloBZGYwyAoyKJAsG/uTlm9Hlk4b5S85f6fuL4d/enF4Mj/F+
9M3g7Cy7qdkco29evTk7XtwtJI9evXw5PD82wpBKCkm1Jy8H38EbbOiTV68v
T1+dD86eQPdCh+T7HhwEtg1aytFGIgkuyAcbqflMeWCa8AAyz49e/++/nZ7F
QbfTOQQcmIeDzn4PHq5nLDS1iTC4sY/Q9zc16EFGJZZCgwC6NeIxDcDGwA7V
TFyHZMYka9Vqf/4n9sy/+uSLsRd1el/ZBGxwITHts0Ki7rNySknYdKIjyVFN
1puF9KWeLuo7+K7wnPZ7LvGLrwMwUdLsHHz9Vc3QJho4GWREcHn21lr1kLxk
kOrl4g3DpiNLDrutnVYXGevrjHCIzyZQgaG1YskKi9YlG0tuWLvnoRckvhUB
2oQKoWpaEANjP0kkZJBzIVkDxh6rPNjVhJhyOMoHWCV1NaaRUhyYR6rkPtbk
EGkRBI99B2gtlhfPaLwan2jVxrgoVh8E4lppd/qBYMREPpBjbd6R7kbH9QFg
PQG7DIGI9DOINvVl/1RfyxlQlHTaBwdQ6MCf8xA9mnbwJuzaAv8h5Lat9eSI
4ECSrFYUPYQ3L+mPfJ7MTW+NoSuvuQ+eJaewS/SwbURbQNBMXtFxwEolVIl2
4M2b0Agy31FntWgX3sDoHbMJTYI4NePlHnaK7sAbbbevwbdaO9djtl50D96M
ZjD2Prng6p0p5gX28RrRDlAbtpX7QOS6ShoY6WMWgK9dKbqLPczDZ9DLK4qo
kt4rV2wE3oIrpql5VknvV6h9JpRa11+dzkFZ+oIp7idw8zwb7Srpw7L04ApC
ZW1jmXiFdLddln6jQwcYvJV1v++Tp5LBtEk0YzruED1t+/KJjaeq6QdiPG2E
Cxf/5NZ68BWoTP04dWQhMA1rIqV6IowpTDUIJb2m8GIWkzGPIUoDG6QwTZuG
CJ8bzY9psJUrUMiWqcRE/sjnzuqwKniXozlw5FC3gozoym2kCSWgx9a5DI8u
ygWtuFpmRk2MP//8M8xP2qR8dRxpXUfajpbvwLsd0iO7ZA/Y/YAcfkxavfaX
5mf+Q/PKXcgcX2ryzaEhu84gvi3wmbWxTWuxfD1PraP62owWelRziJnwKQyn
hczJenNDiFxjfKZtJFW7T3a6TbTwQPdfgzAKYYSyZu8JCT4jEjoiEBAOVqAn
Q4YN0nX8OaEes2gIGIVpHebhENvT0JQO5ivRM0sjCEb86y//NgW2f/3lP41s
jjgXHye90wHxNKZPna0m04yOUjKYu10xdlgaNdtppc24yJMPXRKYoEL3mIBc
l5VF5ykr2pkS/IfMkyTQXOaYnJUIZIWKjxTyaRRymAPn4va+KWRNGHgvFNJ1
UEi1wRU5xK1/iVGMlUH4LXwzA93pIoAV3p4Oh0MyCQTFNU0SCSAOa58WBkmI
OXEOML7B+UvEJLATmLmfw3d1RJyD+YqwuRrtdI6rfHohyYn7LKIuwb3ABjjl
ArSLKyYh0FjMVqJE6tWShslqC51KRnGNByoK7UQurRsUSWdmLp5Y08ZHuvgk
ujjMNex3oYsUaCsmfvdEFzsOulg9Ja1kjUqR+yYQ17w45Y3ENWcu04WLJnLt
ewDkUNmQR074NE7INeL3CyFcprvV3nbkvHctOg9Ci+6D0GLnQWjRexBa7D4I
LfYehBb7d6mFw3v3HN67yjEUnbZz7Xir3TzYXvLWelaLawh2JeGOHDdmuKJB
wlRujSJdfVgTqmuvRnGNI4lIJDluMt9gV7QhvxTJdEb2G1CxpOEUt51BWR56
4HYVaiqkD4roMjLZNhGel0i9VwkVog4qpjJOPTJ0p1nMyCT203wMd9myXDok
wWAAxMc8wJxYL3jkBpE04j7BvW3c6ebG+ds+SAMMdOiLPTBoeaKYFZyykEmz
CG1cPjEnU8gcd4GndmMawqHSWn8aC5U3AcqBkGv31i7W6uWOLOYhejHEvoK7
4rJScFOvZWtK2HH5ZRYY5QgHE3c8IaSa6L2dGDcqGZ/OYp0jwjMfemfbscJC
MNLJHSZQpWjJ3dTHUOnjqO9BhUpaoSHuVuphnTu2sTashZOCdx0U7LS2Iv+W
NF+mXdsezQcpkl1bbymY9ZQrWryLcVuujOdcDo9GhpM4U0tTjWX4OPf8HhH0
6Qjaydnm4vYuEZQbvSMaOUutsPA9h4VXGUTRyIt19slBcRUg9DmenfzNhtmw
LoeBTceUB+AY/MVJgQYEAIwszl90Fqcvdnfa+7e3KYrcu9Cp0VfsUW+NLs5e
bGub9yCS4FbritzZQUE82FY0+QqJEpj0ka7Noumz4UQ+H1CEbMCYC6DJMLWX
B01B9zKuPtyJJvaqGOK3SOWlzJvT5Nkzx7CZq5W7qvI8e/aH6xMnne076Kwa
lEVCW9WKPvhqyXF5sJHiVk8vJhDUbqWvtoHIlKkS+MRG+3jWC2ow8ysW6NOK
6XxAZ58BmntEH15Qlj4Xa50Vh1qyg8iOxU1zutaEDL4+0DJm8TVjUOW1sIua
EH5DK0K4Y37ex4cYk4+FLMfY1edr7iFS+ENzGx6ByqGjoPudctsAj9rZWXap
5uzKncMqXneK4wMHjleaYBHKA1y46JtZ64SzwIeJuZ2FGpQMQjGngUgU2Rps
Y+YWwYm8CT2Wg41eq5MGGwf7u20bbOiq+6Tb03GPqaUY9TigiNsGQBkAD2hk
Iu1+Q4xbDwHiY849Kcy6CTBHuhYDmKChzjcF8cKsYe35tzT0WX9QDoFcbABO
8vW+Kszp0z1W0w67kuFilnptDbUQjX7F5jSMuad06bY8Gw/qzsxWTVAvfVga
peicYXdoPskOSutVn+xgbNt+KWAS9nt4Ura1STL5fC7ZBIA/5Bhk14XPlTxi
8LsRPZBHhqPhxdvh8XK96QXGV0kkG9MDylqrBwDgjvVwkNmhaxv2t8AxOye5
+pxqCvE1p1nXxglXWdZPjxg2CWvyMagmm4gSNhInbMg/kwLC9xw6/xaEb1Sb
PLxK+HIcnr4jbVxnK9vrA4ZlBVcALDvKvSLQDvCk9xa6ZhJR7x2Lcc8Dv/cC
VG1/EoIq/WK99oigz0IQ+dKc2S/ZZO7+HhA0KGLI4aEc3xDchTYuBLmOJ1d+
4bACO+UPGQogoj44npgriyKZ5l5sAz46n4cHnYOSzvfufKoux4cz5etuoeM6
lrv+854VGHJ8zrMKRDTL/oiih4yiw5LODwJFDmtzZ7xbFLlOq34Wisqfta0C
0QI6+S/pH2H04GDULbfuIcDI8RFlxXW3MHIdG1v/vecCRmTEvEQfezrCRXzf
nkNaTIWyXzDIfjFCkVAAnHxuy1dpCVdJgOeYsv1e/CkCmy09/iXwa3QweIet
2+/qF7Zuvnpv2d88GZwP1qqImyugm85LvfT4EIoPvHehuA6YPzU/IJH+rMoY
5nLmR1b+DzxV4+CcSAAA

-->

</rfc>
