<?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.27 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-idr-entropy-label-17" category="std" consensus="true" submissionType="IETF" xml:lang="en" updates="6790, 7447" version="3">
  <!-- xml2rfc v2v3 conversion 3.28.0 -->
  <front>
    <title abbrev="NHC">BGP Next Hop Dependent Characteristics Attribute</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-idr-entropy-label-17"/>
    <author initials="B." surname="Decraene" fullname="Bruno Decraene" role="editor">
      <organization>Orange</organization>
      <address>
        <email>bruno.decraene@orange.com</email>
      </address>
    </author>
    <author initials="J. G." surname="Scudder" fullname="John G. Scudder" role="editor">
      <organization>Juniper Networks</organization>
      <address>
        <email>jgs@juniper.net</email>
      </address>
    </author>
    <author initials="K." surname="Kompella" fullname="Kireeti Kompella">
      <organization>Juniper Networks</organization>
      <address>
        <email>kireeti@juniper.net</email>
      </address>
    </author>
    <author initials="S." surname="Mohanty" fullname="Satya Mohanty">
      <organization>Zscaler</organization>
      <address>
        <email>smohanty@zscaler.com</email>
      </address>
    </author>
    <author initials="B." surname="Wen" fullname="Bin Wen">
      <organization>Comcast</organization>
      <address>
        <email>Bin_Wen@comcast.com</email>
      </address>
    </author>
    <author initials="K." surname="Wang" fullname="Kevin Wang">
      <organization>Juniper Networks</organization>
      <address>
        <email>kfwang@juniper.net</email>
      </address>
    </author>
    <author initials="S." surname="Krier" fullname="Serge Krier">
      <organization>Cisco Systems</organization>
      <address>
        <email>sekrier@cisco.com</email>
      </address>
    </author>
    <date year="2025" month="March" day="31"/>
    <area>rtg</area>
    <workgroup>Internet Engineering Task Force</workgroup>
    <keyword>bgp</keyword>
    <keyword>nhc</keyword>
    <keyword>entropy label</keyword>
    <abstract>
      <?line 76?>

<t>RFC 5492 allows a BGP speaker to advertise its capabilities to its peer. When a route is propagated beyond the immediate peer, it is useful to allow certain characteristics to be conveyed further.  In particular, it is useful to advertise forwarding plane features.</t>
      <t>This specification defines a BGP transitive attribute to carry such information, the "Next Hop Dependent Characteristics Attribute," or NHC. Unlike the capabilities defined by RFC 5492, the characteristics conveyed in the NHC apply solely to the routes advertised by the BGP UPDATE that contains the particular NHC.</t>
      <t>This specification also defines an NHC characteristic that can be used to advertise the ability to process the MPLS Entropy Label as an egress LSR for all NLRI advertised in the BGP UPDATE.  It updates RFC 6790 and RFC 7447 concerning this BGP signaling.</t>
    </abstract>
  </front>
  <middle>
    <?line 84?>

<section anchor="intro">
      <name>Introduction</name>
      <t><xref target="RFC5492"/> allows a Border Gateway Protocol (BGP) speaker to advertise its capabilities to its peer. When a route is propagated beyond the immediate peer, it is useful to allow certain characteristics to be conveyed further.  In particular, it may be useful to advertise forwarding plane features.</t>
      <t>This specification defines a BGP optional transitive attribute to carry such information, the "Next Hop Dependent Characteristics Attribute", or NHC.</t>
      <t>Since the NHC is intended chiefly for conveying information about forwarding plane features, it needs to be regenerated whenever the BGP route's next hop is changed. Since owing to the properties of BGP transitive attributes this can't be guaranteed (an intermediate router that doesn't implement this specification would be expected to propagate the NHC as opaque data), the NHC encodes the next hop of its originator, or the router that most recently updated the attribute. If the NHC passes through a router that changes the next hop without regenerating the NHC, they will fail to match when later examined, and the recipient can act accordingly. This scheme allows NHC support to be introduced into a network incrementally. Informally, the intent is that,</t>
      <ul spacing="normal">
        <li>
          <t>If a router is not changing the next hop, it can obliviously propagate the NHC just like any other optional transitive attribute.</t>
        </li>
        <li>
          <t>If a router is changing the next hop, then it has to be able to vouch for every characteristic it includes in the NHC.</t>
        </li>
      </ul>
      <t>Complete details are provided in <xref target="tbrc"/>.</t>
      <t>An NHC carried in a given BGP UPDATE message conveys information that relates to all Network Layer Reachability Information (NLRI) advertised in that particular UPDATE, and only to those NLRI. A different UPDATE message originated by the same source might not include an NHC, and if so, NLRI carried in that UPDATE would not be affected by the NHC. By implication, if a router wishes to use NHC to describe all NLRI it originates, it needs to include an NHC with each UPDATE it sends.</t>
      <t>Informally, a characteristic included in a given NHC should not be thought of as a characteristic of the next hop, but rather a characteristic of the path, that depends on the ability of the next hop to support it. Hence it is said to be "dependent on" the next hop.</t>
      <t>This specification also defines an NHC characteristic, called "ELCv3", to advertise the ability to process the Multiprotocol Label Switching (MPLS) Entropy Label as an egress Label Switching Router (LSR) for all NLRI advertised in the BGP UPDATE.  It updates <xref target="RFC6790"/> and <xref target="RFC7447"/> with regard to this BGP signaling, this is further discussed in <xref target="elcv3"/>. Although ELCv3 is only relevant to NLRI of labeled address families, a future NHC characteristic might be applicable to non-labeled NLRI, or to both, irrespective of labels. (The term "labeled address family" is defined in the first paragraph of Section 3.5 of <xref target="RFC9012"/>. In this document, we use the term "labeled NLRI" as a short form of "NLRI of a labeled address family.")</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="tbrc">
      <name>BGP Next Hop Dependent Characteristics Attribute</name>
      <section anchor="encoding">
        <name>Encoding</name>
        <t>The BGP Next Hop Dependent Characteristics attribute (NHC attribute, or just NHC) is an optional, transitive BGP path attribute with type code 39. The NHC always includes a network layer address identifying the next hop of the route the NHC accompanies. The NHC signals potentially useful information related to the forwarding plane features, so it is desirable to make it transitive to ensure propagation across BGP speakers (e.g., route reflectors) that do not change the next hop and are therefore not in the forwarding path. The next hop data is to ensure correctness if it traverses BGP speakers that do not understand the NHC. This is further explained below.</t>
        <t>The Attribute Data field of the NHC attribute is encoded as a header portion that identifies the router that created or most recently updated the attribute, followed by one or more Type-Length-Value (TLV) triples:</t>
        <figure anchor="nhcformat">
          <name>NHC Format</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="256" width="528" viewBox="0 0 528 256" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,64 L 8,112" fill="none" stroke="black"/>
                <path d="M 8,144 L 8,176" fill="none" stroke="black"/>
                <path d="M 8,208 L 8,224" fill="none" stroke="black"/>
                <path d="M 264,64 L 264,96" fill="none" stroke="black"/>
                <path d="M 392,64 L 392,96" fill="none" stroke="black"/>
                <path d="M 520,64 L 520,112" fill="none" stroke="black"/>
                <path d="M 520,144 L 520,176" fill="none" stroke="black"/>
                <path d="M 520,208 L 520,224" fill="none" stroke="black"/>
                <path d="M 8,64 L 520,64" fill="none" stroke="black"/>
                <path d="M 8,96 L 520,96" fill="none" stroke="black"/>
                <path d="M 8,160 L 520,160" fill="none" stroke="black"/>
                <path d="M 8,224 L 520,224" fill="none" stroke="black"/>
                <g class="text">
                  <text x="16" y="36">0</text>
                  <text x="176" y="36">1</text>
                  <text x="336" y="36">2</text>
                  <text x="496" y="36">3</text>
                  <text x="16" y="52">0</text>
                  <text x="32" y="52">1</text>
                  <text x="48" y="52">2</text>
                  <text x="64" y="52">3</text>
                  <text x="80" y="52">4</text>
                  <text x="96" y="52">5</text>
                  <text x="112" y="52">6</text>
                  <text x="128" y="52">7</text>
                  <text x="144" y="52">8</text>
                  <text x="160" y="52">9</text>
                  <text x="176" y="52">0</text>
                  <text x="192" y="52">1</text>
                  <text x="208" y="52">2</text>
                  <text x="224" y="52">3</text>
                  <text x="240" y="52">4</text>
                  <text x="256" y="52">5</text>
                  <text x="272" y="52">6</text>
                  <text x="288" y="52">7</text>
                  <text x="304" y="52">8</text>
                  <text x="320" y="52">9</text>
                  <text x="336" y="52">0</text>
                  <text x="352" y="52">1</text>
                  <text x="368" y="52">2</text>
                  <text x="384" y="52">3</text>
                  <text x="400" y="52">4</text>
                  <text x="416" y="52">5</text>
                  <text x="432" y="52">6</text>
                  <text x="448" y="52">7</text>
                  <text x="464" y="52">8</text>
                  <text x="480" y="52">9</text>
                  <text x="496" y="52">0</text>
                  <text x="512" y="52">1</text>
                  <text x="64" y="84">Address</text>
                  <text x="124" y="84">Family</text>
                  <text x="196" y="84">Identifier</text>
                  <text x="324" y="84">SAFI</text>
                  <text x="420" y="84">Next</text>
                  <text x="456" y="84">Hop</text>
                  <text x="488" y="84">Len</text>
                  <text x="8" y="132">~</text>
                  <text x="144" y="132">Network</text>
                  <text x="208" y="132">Address</text>
                  <text x="252" y="132">of</text>
                  <text x="284" y="132">Next</text>
                  <text x="320" y="132">Hop</text>
                  <text x="380" y="132">(variable)</text>
                  <text x="520" y="132">~</text>
                  <text x="8" y="196">~</text>
                  <text x="204" y="196">Characteristic</text>
                  <text x="284" y="196">TLVs</text>
                  <text x="348" y="196">(variable)</text>
                  <text x="520" y="196">~</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![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
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |   Address Family Identifier   |     SAFI      | Next Hop Len  |
   +-------------------------------+---------------+---------------+
   |                                                               |
   ~             Network Address of Next Hop (variable)            ~
   |                                                               |
   +---------------------------------------------------------------+
   |                                                               |
   ~                 Characteristic TLVs (variable)                ~
   |                                                               |
   +---------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>The meanings of the header fields (Address Family Identifier, SAFI or Subsequent Address Family Identifier, Length of Next Hop, and Network Address of Next Hop) are as given in Section 3 of <xref target="RFC4760"/>.</t>
        <t>In turn, each Characteristic is a TLV:</t>
        <figure>
          <name>Characteristic TLV Format</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="192" width="528" viewBox="0 0 528 192" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,64 L 8,112" fill="none" stroke="black"/>
                <path d="M 8,144 L 8,160" fill="none" stroke="black"/>
                <path d="M 264,64 L 264,96" fill="none" stroke="black"/>
                <path d="M 520,64 L 520,112" fill="none" stroke="black"/>
                <path d="M 520,144 L 520,160" fill="none" stroke="black"/>
                <path d="M 8,64 L 520,64" fill="none" stroke="black"/>
                <path d="M 8,96 L 520,96" fill="none" stroke="black"/>
                <path d="M 8,160 L 520,160" fill="none" stroke="black"/>
                <g class="text">
                  <text x="16" y="36">0</text>
                  <text x="176" y="36">1</text>
                  <text x="336" y="36">2</text>
                  <text x="496" y="36">3</text>
                  <text x="16" y="52">0</text>
                  <text x="32" y="52">1</text>
                  <text x="48" y="52">2</text>
                  <text x="64" y="52">3</text>
                  <text x="80" y="52">4</text>
                  <text x="96" y="52">5</text>
                  <text x="112" y="52">6</text>
                  <text x="128" y="52">7</text>
                  <text x="144" y="52">8</text>
                  <text x="160" y="52">9</text>
                  <text x="176" y="52">0</text>
                  <text x="192" y="52">1</text>
                  <text x="208" y="52">2</text>
                  <text x="224" y="52">3</text>
                  <text x="240" y="52">4</text>
                  <text x="256" y="52">5</text>
                  <text x="272" y="52">6</text>
                  <text x="288" y="52">7</text>
                  <text x="304" y="52">8</text>
                  <text x="320" y="52">9</text>
                  <text x="336" y="52">0</text>
                  <text x="352" y="52">1</text>
                  <text x="368" y="52">2</text>
                  <text x="384" y="52">3</text>
                  <text x="400" y="52">4</text>
                  <text x="416" y="52">5</text>
                  <text x="432" y="52">6</text>
                  <text x="448" y="52">7</text>
                  <text x="464" y="52">8</text>
                  <text x="480" y="52">9</text>
                  <text x="496" y="52">0</text>
                  <text x="512" y="52">1</text>
                  <text x="116" y="84">Characteristic</text>
                  <text x="196" y="84">Code</text>
                  <text x="372" y="84">Characteristic</text>
                  <text x="460" y="84">Length</text>
                  <text x="8" y="132">~</text>
                  <text x="196" y="132">Characteristic</text>
                  <text x="280" y="132">Value</text>
                  <text x="348" y="132">(variable)</text>
                  <text x="520" y="132">~</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![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
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |      Characteristic Code      |      Characteristic Length    |
   +-------------------------------+-------------------------------+
   |                                                               |
   ~                Characteristic Value (variable)                ~
   |                                                               |
   +---------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Characteristic Code: a two-octet unsigned integer that indicates the type of characteristic advertised and unambiguously identifies an individual characteristic.</t>
        <t>Characteristic Length: a two-octet unsigned integer that indicates the length, in octets, of the Characteristic Value field.  A length of 0 indicates that the Characteristic Value field is zero-length, i.e. it has a null value.</t>
        <t>Characteristic Value: a variable-length field.  It is interpreted according to the value of the Characteristic Code.</t>
        <t>A BGP speaker <bcp14>MUST NOT</bcp14> include more than one instance of a characteristic with the same Characteristic Code, Characteristic Length, and Characteristic Value.  Note, however, that processing multiple instances of such a characteristic does not require special handling, as additional instances do not change the meaning of the announced characteristic; thus, a BGP speaker <bcp14>MUST</bcp14> be prepared to accept such multiple instances.</t>
        <t>BGP speakers <bcp14>MAY</bcp14> include more than one instance of a characteristic (as identified by the Characteristic Code) with different Characteristic Value.  Processing of these characteristic instances is specific to the Characteristic Code and <bcp14>MUST</bcp14> be described in the document introducing the new characteristic.</t>
        <t>Characteristic TLVs <bcp14>MUST</bcp14> be placed in the NHC in increasing order of Characteristic Code. (In the event of multiple instances of a characteristic with the same Characteristic Code as discussed above, no further sorting order is defined here.)  Although the major sorting order is mandated, an implementation <bcp14>MUST</bcp14> elect to be prepared to consume characteristics in any order, for robustness reasons.</t>
      </section>
      <section anchor="sending">
        <name>Sending the NHC</name>
        <t>Suppose a BGP speaker S has a route R it wishes to advertise with next hop N to its peer.</t>
        <t>If S is originating R into BGP, it <bcp14>MAY</bcp14> include an NHC attribute with it, that carries characteristic TLVs that describe aspects of R. S <bcp14>MUST</bcp14> set the next hop depicted in the header portion of the NHC to be equal to N, using the encoding given above.</t>
        <t>If S has received R from some other BGP speaker, two possibilities exist. First, S could be propagating R without changing N. In that case, S does not need to take any special action, it <bcp14>SHOULD</bcp14> simply propagate the NHC unchanged unless specifically configured otherwise. Indeed, we observe that this is no different from the default action a BGP speaker takes with an unrecognized optional transitive attribute -- it is treated as opaque data and propagated.</t>
        <t>Second, S could be changing R in some way, and in particular, it could be changing N. If S has changed N it <bcp14>MUST NOT</bcp14> propagate the NHC unchanged. It <bcp14>SHOULD</bcp14> include a newly-constructed NHC attribute with R, constructed as described above in the "originating R into BGP" case. Any given characteristic TLV carried by the newly-constructed NHC attribute might use information from the received NHC attribute as input to its construction, possibly as straightforwardly as simply copying the TLV. The details of how the characteristics in the new NHC are constructed are specific to the definition of each characteristics. Any characteristic TLVs received by S that are for characteristics not supported by S will not be included in the newly-constructed NHC attribute S includes with R.</t>
        <t>An implementation <bcp14>SHOULD</bcp14> propagate the NHC and its contained characteristics by default. An implementation <bcp14>SHOULD</bcp14> provide configuration control of whether any given characteristic is propagated. An implementation <bcp14>MAY</bcp14> provide finer-grained control on propagation based on attributes of the peering session, as discussed in <xref target="Security_NHC"/>.</t>
        <t>Due to the nature of BGP optional transitive path attributes, any BGP speaker that does not implement this specification will propagate the NHC, the requirements of this section notwithstanding. Such a speaker will not update the NHC, however.</t>
        <t>Certain NLRI formats do not include a next hop at all, one example being the Flow Specification NLRI <xref target="RFC8955"/>. The NHC <bcp14>MUST NOT</bcp14> be sent with such NLRI.</t>
        <section anchor="llnh">
          <name>Link-Local-Only Next Hops</name>
          <t>In some cases, the BGP speaker sending a route might encode only a link-local address and no global address. In such a case, a problem arises because there is no expectation of global uniqueness of such an address, and the "semantic match" discussed in <xref target="receiving"/> could yeild a false positive. An illustration is provided in <xref target="falsepos"/>.</t>
          <t>To mitigate this problem, if a BGP speaker originates a route whose next hop has no global part, it <bcp14>MUST</bcp14> include a BGPID TLV (<xref target="bgpid"/>).</t>
        </section>
        <section anchor="nhcaggregation">
          <name>Aggregation</name>
          <t>When aggregating routes, the above rules for constructing a new NHC <bcp14>MUST</bcp14> be followed. The decision of whether to include the NHC with the aggregate route and what its form will be, depends in turn on whether any characteristics are eligible to be included with the aggregate route.  If there are no eligible characteristics, the NHC <bcp14>MUST NOT</bcp14> be included.</t>
          <t>The specification for an individual characteristic must define how that characteristic is to be aggregated. If no rules are defined for a given characteristic, that characteristic <bcp14>MUST NOT</bcp14> be aggregated. Rules for aggregating the ELCv3 are found in <xref target="elcv3aggregation"/>.</t>
          <t>(Route aggregation is described in <xref target="RFC4271"/>. Although prefix aggregation -- combining two or more more-specific prefixes to form one less-specific prefix -- is one application of aggregation, we note that another is when two or more routes for the same prefix are selected to be used for multipath forwarding.)</t>
        </section>
      </section>
      <section anchor="receiving">
        <name>Receiving the NHC</name>
        <t>An implementation receiving routes with a NHC <bcp14>SHOULD NOT</bcp14> discard the attribute or its contained characteristics by default. An implementation <bcp14>SHOULD</bcp14> provide configuration control of whether any given characteristic is processed. An implementation <bcp14>MAY</bcp14> provide finer-grained control on propagation based on attributes of the peering session, as discussed in <xref target="Security_NHC"/>.</t>
        <t>When a BGP speaker receives a BGP route that includes the NHC, it <bcp14>MUST</bcp14> compare the address given in the header portion of the NHC and illustrated in <xref target="nhcformat"/> to the next hop of the BGP route. If the two match, the NHC may be further processed. If the two do not match, it means some intermediate BGP speaker that handled the route in transit both does not support NHC, and changed the next hop of the route. In this case, the contents of the NHC cannot be used, and the NHC <bcp14>MUST</bcp14> be discarded without further processing, except that the contents <bcp14>MAY</bcp14> be logged.</t>
        <t>In considering whether the next hop "matches", a semantic match is sought. While bit-for-bit equality is a trivial test of matching, there may be certain cases where the two are not bit-for-bit equal, but still "match". An example is when an MP_REACH Next Hop encodes both a global and a link-local IPv6 address. In that case, the link-local address might be removed during Internal BGP (IBGP) propagation, the two would still be considered to match if they were equal on the global part. See Section 3 of <xref target="RFC2545"/>. In other cases, only a link-local address might be present. This is discussed in <xref target="llnh"/>; in such a case further information is required to permit matching, this is discussed in <xref target="bgpid"/>.</t>
        <t>A BGP speaker receiving a Characteristic Code that it supports behaves as defined in the document defining the Characteristic Code.  A BGP speaker receiving a Characteristic Code that it does not support <bcp14>MUST</bcp14> ignore that Characteristic Code.  In particular, the receipt of an unrecognized Characteristic Code <bcp14>MUST NOT</bcp14> be handled as an error.</t>
        <t>The presence of a characteristic <bcp14>SHOULD NOT</bcp14> influence route selection or route preference, unless tunneling is used to reach the BGP next hop, the selected route has been learned from External BGP (that is, the next hop is in a different Autonomous System), or by configuration (see following).  Indeed, it is in general impossible for a node to know that all BGP routers of the Autonomous System (AS) will understand a given characteristic, and if different routers within an AS were to use a different preference for a route, forwarding loops could result unless tunneling is used to reach the BGP next hop. Following this reasoning, if the administrator of the network is confident that all routers within the AS will interpret the presence of the characteristic in the same way, they could relax this restriction by configuration.</t>
      </section>
      <section anchor="attribute-error-handling">
        <name>Attribute Error Handling</name>
        <t>An NHC is considered malformed if the length of the attribute, encoded in the Attribute Length field of the BGP Path Attribute header (Section 4.3 of <xref target="RFC4271"/>), is inconsistent with the lengths of the contained characteristic TLVs. In other words, the sum of the sizes (Characteristic Length plus 4) of the contained characteristic TLVs, plus the length of the NHC header (<xref target="nhcformat"/>), must be equal to the overall Attribute Length.</t>
        <t>A BGP UPDATE message with a malformed NHC <bcp14>SHALL</bcp14> be handled using the approach of "attribute discard" defined in <xref target="RFC7606"/>.</t>
        <t>Unknown Characteristic Codes <bcp14>MUST NOT</bcp14> be considered to be an error.</t>
        <t>An NHC that contains no characteristic TLVs <bcp14>MAY</bcp14> be considered malformed, although it is observed that the prescribed behavior of "attribute discard" is semantically no different from that of having no TLVs to process. There is no reason to propagate an NHC that contains no characteristic TLVs.</t>
        <t>A document that specifies a new NHC Characteristic should provide specifics regarding what constitutes an error for that NHC Characteristic.</t>
        <t>If a characteristic TLV is malformed, that characteristic TLV <bcp14>SHOULD</bcp14> be ignored and removed.  Other characteristic TLVs <bcp14>SHOULD</bcp14> be processed as usual. If a given characteristic TLV requires different error-handling treatment than described in the previous sentences, its specification should provide specifics.</t>
      </section>
      <section anchor="network-operation-considerations">
        <name>Network Operation Considerations</name>
        <t>In the corner case where multiple nodes use the same IP address as their BGP next hop, such as with anycast nodes as described in <xref target="RFC4786"/>, a BGP speaker <bcp14>MUST NOT</bcp14> advertise a given characteristic unless all nodes sharing this same IP address support this characteristic. The network operator operating those anycast nodes is responsible for ensuring that an anycast node does not advertise a characteristic not supported by all nodes sharing this anycast address.  The means for accomplishing this are beyond the scope of this document.</t>
      </section>
    </section>
    <section anchor="elcv3">
      <name>Entropy Label Characteristic (ELCv3)</name>
      <t>The foregoing sections define the NHC as a container for characteristic TLVs. The Entropy Label Characteristic is one such characteristic.</t>
      <t>When BGP <xref target="RFC4271"/> is used for distributing labeled NLRI as described in, for example, <xref target="RFC8277"/>, the route may include the ELCv3 as part of the NHC.  The inclusion of this characteristic with a route indicates that the egress of the associated Label Switched Path (LSP) can process entropy labels as an egress LSR for that route -- see Section 4.1 of <xref target="RFC6790"/>. Below, we refer to this for brevity as being "EL-capable."</t>
      <t>For historical reasons, this characteristic is referred to as "ELCv3", to distinguish it from the prior Entropy Label Capability (ELC) defined in <xref target="RFC6790"/> and deprecated in <xref target="RFC7447"/>, and the ELCv2 described in <xref target="I-D.scudder-bgp-entropy-label"/>.</t>
      <t>This section (and its subsections) replaces Section 5.2 of <xref target="RFC6790"/>, which was previously deprecated by <xref target="RFC7447"/>.</t>
      <section anchor="encoding-1">
        <name>Encoding</name>
        <t>The ELCv3 has characteristic code 1, characteristic length 0, and carries no value:</t>
        <figure>
          <name>ELCv3 TLV Format</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="128" width="528" viewBox="0 0 528 128" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,64 L 8,96" fill="none" stroke="black"/>
                <path d="M 264,64 L 264,96" fill="none" stroke="black"/>
                <path d="M 520,64 L 520,96" fill="none" stroke="black"/>
                <path d="M 8,64 L 520,64" fill="none" stroke="black"/>
                <path d="M 8,96 L 520,96" fill="none" stroke="black"/>
                <g class="text">
                  <text x="16" y="36">0</text>
                  <text x="176" y="36">1</text>
                  <text x="336" y="36">2</text>
                  <text x="496" y="36">3</text>
                  <text x="16" y="52">0</text>
                  <text x="32" y="52">1</text>
                  <text x="48" y="52">2</text>
                  <text x="64" y="52">3</text>
                  <text x="80" y="52">4</text>
                  <text x="96" y="52">5</text>
                  <text x="112" y="52">6</text>
                  <text x="128" y="52">7</text>
                  <text x="144" y="52">8</text>
                  <text x="160" y="52">9</text>
                  <text x="176" y="52">0</text>
                  <text x="192" y="52">1</text>
                  <text x="208" y="52">2</text>
                  <text x="224" y="52">3</text>
                  <text x="240" y="52">4</text>
                  <text x="256" y="52">5</text>
                  <text x="272" y="52">6</text>
                  <text x="288" y="52">7</text>
                  <text x="304" y="52">8</text>
                  <text x="320" y="52">9</text>
                  <text x="336" y="52">0</text>
                  <text x="352" y="52">1</text>
                  <text x="368" y="52">2</text>
                  <text x="384" y="52">3</text>
                  <text x="400" y="52">4</text>
                  <text x="416" y="52">5</text>
                  <text x="432" y="52">6</text>
                  <text x="448" y="52">7</text>
                  <text x="464" y="52">8</text>
                  <text x="480" y="52">9</text>
                  <text x="496" y="52">0</text>
                  <text x="512" y="52">1</text>
                  <text x="100" y="84">Characteristic</text>
                  <text x="180" y="84">Code</text>
                  <text x="208" y="84">=</text>
                  <text x="224" y="84">1</text>
                  <text x="348" y="84">Characteristic</text>
                  <text x="436" y="84">Length</text>
                  <text x="472" y="84">=</text>
                  <text x="488" y="84">0</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![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
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |    Characteristic Code = 1    |   Characteristic Length = 0   |
   +-------------------------------+-------------------------------+
]]></artwork>
          </artset>
        </figure>
      </section>
      <section anchor="sending-the-elcv3">
        <name>Sending the ELCv3</name>
        <t>When a BGP speaker S has a route R it wishes to advertise with next hop N to its peer, it <bcp14>MAY</bcp14> include the ELCv3 characteristic if it knows that the egress of the associated LSP L is EL-capable, otherwise it <bcp14>MUST NOT</bcp14> include the ELCv3 characteristic. Specific conditions where S would know that the egress is EL-capable are if S:</t>
        <ul spacing="normal">
          <li>
            <t>Is itself the egress, and knows itself to be EL-capable, or</t>
          </li>
          <li>
            <t>Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is preserving the value of N as received, or</t>
          </li>
          <li>
            <t>Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is changing the next hop that it has received to N, and knows that this new next hop (normally itself) is EL-capable, or</t>
          </li>
          <li>
            <t>Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is changing the next hop that it has received to N, and knows (for example, through configuration) that  the new next hop (normally itself) even if not EL-capable will simply swap labels without popping the BGP-advertised label stack and processing the label below, as with a transit LSR, or</t>
          </li>
          <li>
            <t>Knows by implementation-specific means that the egress is EL-capable, or</t>
          </li>
          <li>
            <t>Is redistributing a route learned from another protocol, and that other protocol conveyed the knowledge that the egress of L was EL-capable. (For example, this might be known through the Label Distribution Protocol (LDP) ELC TLV, Section 5.1 of <xref target="RFC6790"/>.)</t>
          </li>
        </ul>
        <t>The ELCv3 <bcp14>MAY</bcp14> be advertised with routes that are labeled, such as those using SAFI 4 <xref target="RFC8277"/>. It <bcp14>MUST NOT</bcp14> be advertised with unlabeled routes.</t>
        <section anchor="elcv3aggregation">
          <name>Aggregation</name>
          <t>When forming an aggregate (see <xref target="nhcaggregation"/>), the aggregate route thus formed <bcp14>MUST NOT</bcp14> include the ELCv3 unless each constituent route would be eligible to include the ELCv3 according to the criteria given above.</t>
        </section>
      </section>
      <section anchor="receiving-the-elcv3">
        <name>Receiving the ELCv3</name>
        <t>(Below, we assume that "includes the ELCv3" implies that the containing NHC has passed the checks specified in <xref target="receiving"/>. If it had not passed, then the NHC would have been discarded and the ELCv3 would be deemed not to have been included.)</t>
        <t>When a BGP speaker receives an unlabeled route that includes the ELCv3, it <bcp14>MUST</bcp14> discard the ELCv3.</t>
        <t>When a BGP speaker receives a labeled route that includes the ELCv3, it indicates that it can safely insert an entropy label into the label stack of the associated LSP. This implies that the receiving BGP speaker if acting as ingress, <bcp14>MAY</bcp14> insert an entropy label as per Section 4.2 of <xref target="RFC6790"/>.</t>
      </section>
      <section anchor="elcv3-error-handling">
        <name>ELCv3 Error Handling</name>
        <t>The ELCv3 is considered malformed and must be disregarded if its length is other than zero.</t>
        <t>If more than one instance of the ELCv3 is included in an NHC, instances beyond the first <bcp14>MUST</bcp14> be disregarded.</t>
      </section>
    </section>
    <section anchor="bgpid">
      <name>BGP Identifier Characteristic</name>
      <t>As discussed in <xref target="llnh"/>, it might be possible that a route could be originated that has no global part in its next hop. To provide uniqueness in this case, it is sufficient to associate the BGP Identifier and AS Number of the route's sender. The BGP Identifier Characteristic (BGPID) provides a way to convey this information if required.</t>
      <section anchor="encoding-2">
        <name>Encoding</name>
        <t>The BGPID has characteristic code 3, characteristic length 8, and carries as its value the BGP Identifier and Autonomous System Number of its sender:</t>
        <figure>
          <name>BGPID TLV Format</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="192" width="528" viewBox="0 0 528 192" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,64 L 8,160" fill="none" stroke="black"/>
                <path d="M 264,64 L 264,96" fill="none" stroke="black"/>
                <path d="M 520,64 L 520,160" fill="none" stroke="black"/>
                <path d="M 8,64 L 520,64" fill="none" stroke="black"/>
                <path d="M 8,96 L 520,96" fill="none" stroke="black"/>
                <path d="M 8,128 L 520,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 520,160" fill="none" stroke="black"/>
                <g class="text">
                  <text x="16" y="36">0</text>
                  <text x="176" y="36">1</text>
                  <text x="336" y="36">2</text>
                  <text x="496" y="36">3</text>
                  <text x="16" y="52">0</text>
                  <text x="32" y="52">1</text>
                  <text x="48" y="52">2</text>
                  <text x="64" y="52">3</text>
                  <text x="80" y="52">4</text>
                  <text x="96" y="52">5</text>
                  <text x="112" y="52">6</text>
                  <text x="128" y="52">7</text>
                  <text x="144" y="52">8</text>
                  <text x="160" y="52">9</text>
                  <text x="176" y="52">0</text>
                  <text x="192" y="52">1</text>
                  <text x="208" y="52">2</text>
                  <text x="224" y="52">3</text>
                  <text x="240" y="52">4</text>
                  <text x="256" y="52">5</text>
                  <text x="272" y="52">6</text>
                  <text x="288" y="52">7</text>
                  <text x="304" y="52">8</text>
                  <text x="320" y="52">9</text>
                  <text x="336" y="52">0</text>
                  <text x="352" y="52">1</text>
                  <text x="368" y="52">2</text>
                  <text x="384" y="52">3</text>
                  <text x="400" y="52">4</text>
                  <text x="416" y="52">5</text>
                  <text x="432" y="52">6</text>
                  <text x="448" y="52">7</text>
                  <text x="464" y="52">8</text>
                  <text x="480" y="52">9</text>
                  <text x="496" y="52">0</text>
                  <text x="512" y="52">1</text>
                  <text x="100" y="84">Characteristic</text>
                  <text x="180" y="84">Code</text>
                  <text x="208" y="84">=</text>
                  <text x="224" y="84">3</text>
                  <text x="348" y="84">Characteristic</text>
                  <text x="436" y="84">Length</text>
                  <text x="472" y="84">=</text>
                  <text x="488" y="84">8</text>
                  <text x="216" y="116">BGP</text>
                  <text x="276" y="116">Identifier</text>
                  <text x="228" y="148">AS</text>
                  <text x="268" y="148">Number</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![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
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   |    Characteristic Code = 3    |   Characteristic Length = 8   |
   +-------------------------------+-------------------------------+
   |                        BGP Identifier                         |
   +---------------------------------------------------------------+
   |                          AS Number                            |
   +---------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>BGP Identifier: The BGP Identifier (Section 4.2 of <xref target="RFC4271"/>, and <xref target="RFC6286"/>) of the route's sender.</t>
        <t>AS Number: The Autonomous System Number <xref target="RFC6793"/> of the route's sender. In cases where the sender might represent different Autonomous System Numbers to different peers (for example, <xref target="RFC5065"/>, <xref target="RFC7705"/>), the value used is the one that was in the sender's BGP OPEN to the peer concerned.</t>
      </section>
      <section anchor="sending-the-bgpid">
        <name>Sending the BGPID</name>
        <t>Under the circumstances described in <xref target="llnh"/> the BGPID <bcp14>MUST</bcp14> be included. Under other circumstances, the BGPID <bcp14>MAY</bcp14> be included.</t>
        <section anchor="aggregation">
          <name>Aggregation</name>
          <t>Since the BGPID, by definition, is regenerated whenever the next hop is changed and provides context to disambiguate the next hop carried in the NHC header, there is no case in which it might need to be aggregated.</t>
        </section>
      </section>
      <section anchor="rcv_bgpid">
        <name>Receiving the BGPID</name>
        <t>Under the circumstances described in <xref target="llnh"/>, a NEXT_HOP received from a given peer <bcp14>MUST NOT</bcp14> be considered a "semantic match" for the NHC unless the BGP Identifier and Autonomous System of that peer match the BGP Identifier and Autonomous System carried in the BGPID.</t>
        <t>Since the only case in which the BGPID might be needed to disambiguate the next hop carried in the NHC involves the immediate peer (see <xref target="falsepos"/> for more detail), the BGP Identifier and Autonomous System of the peer are readily derived, they are the values that were received in that peer's OPEN message.</t>
        <t>Other uses of the BGPID are beyond the scope of this document. In particular, if a route is received that has a global part to its NEXT_HOP and thus, does not match the circumstances described in <xref target="llnh"/>, but which nonetheless has a BGPID, this specification requires no specific action. In such a case, the BGPID can be disregarded.</t>
        <section anchor="not-receiving-the-bgpid">
          <name>Not Receiving the BGPID</name>
          <t>Under the circumstances described in <xref target="llnh"/>, if a BGPID is not present in the NHC, the next hop match described in <xref target="receiving"/> <bcp14>MUST</bcp14> be considered to have failed.</t>
        </section>
      </section>
      <section anchor="bgpid-error-handling">
        <name>BGPID Error Handling</name>
        <t>The BGPID is considered malformed and must be disregarded if its length is other than eight.</t>
        <t>If more than one instance of the BGPID is included in an NHC, instances beyond the first <bcp14>MUST</bcp14> be disregarded.</t>
        <t>The situation where a route is received which fails the test described in <xref target="rcv_bgpid"/> is not an error. However, it might indicate a misconfiguration in the network, and a message <bcp14>MAY</bcp14> be logged.</t>
      </section>
    </section>
    <section anchor="legacy-elc">
      <name>Legacy ELC</name>
      <t>The ELCv3 functionality introduced in this document replaces the "BGP Entropy Label Capability Attribute" (ELC attribute) that was introduced by <xref target="RFC6790"/>, and deprecated by <xref target="RFC7447"/>. The latter RFC specifies that the ELC attribute, BGP path attribute 28, "<bcp14>MUST</bcp14> be treated as any other unrecognized optional, transitive attribute". This specification revises that requirement.</t>
      <t>As the current specification was developed, it became clear that due to incompatibilities between how the ELC attribute is processed by different fielded implementations, the most prudent handling of attribute 28 is not to propagate it as an unrecognized optional, transitive attribute, but to discard it. Therefore, this specification updates <xref target="RFC7447"/>, by instead requiring that an implementation that receives the ELC attribute <bcp14>MUST</bcp14> discard any received ELC attribute.</t>
    </section>
    <section anchor="IANA">
      <name>IANA Considerations</name>
      <t>IANA has made a temporary allocation in the BGP Path Attributes registry of the Border Gateway Protocol (BGP) Parameters group. IANA is requested to make this allocation permanent, and to update its name and reference as shown below.</t>
      <table>
        <thead>
          <tr>
            <th align="left">Value</th>
            <th align="left">Code</th>
            <th align="left">Reference</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">39</td>
            <td align="left">BGP Next Hop Dependent Characteristic (NHC)</td>
            <td align="left">(this doc)</td>
          </tr>
        </tbody>
      </table>
      <t>IANA is requested to create a new registry called "BGP Next Hop Dependent Characteristic Codes" within the Border Gateway Protocol (BGP) Parameters group. The registry's allocation policy is First Come, First Served, except where designated otherwise in <xref target="preregistry"/>. It is seeded with the following values:</t>
      <table anchor="preregistry">
        <thead>
          <tr>
            <th align="left">Value</th>
            <th align="left">Description</th>
            <th align="left">Reference</th>
            <th align="left">Change Controller</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">0</td>
            <td align="left">reserved</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">1</td>
            <td align="left">ELCv3</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">2</td>
            <td align="left">NNHN</td>
            <td align="left">draft-wang-idr-next-next-hop-nodes-01</td>
            <td align="left">kfwang@juniper.net</td>
          </tr>
          <tr>
            <td align="left">3</td>
            <td align="left">BGPID</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">4</td>
            <td align="left">IFIT</td>
            <td align="left">draft-ietf-idr-bgp-ifit-capabilities-05</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">65400 - 65499</td>
            <td align="left">private use</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">65500 - 65534</td>
            <td align="left">reserved for experimental use</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
          <tr>
            <td align="left">65535</td>
            <td align="left">reserved</td>
            <td align="left">(this doc)</td>
            <td align="left">IETF</td>
          </tr>
        </tbody>
      </table>
    </section>
    <section anchor="Security">
      <name>Security Considerations</name>
      <section anchor="Security_NHC">
        <name>Considerations for the NHC</name>
        <t>The header portion of the NHC contains the next hop the attribute's originator included when sending it, or that an intermediate router included when updating the attribute (in the latter case, the "contract" with the intermediate router is that it performed the checks in <xref target="receiving"/> before propagating the attribute). This will typically be an IP address of the router in question. This may be an infrastructure address the network operator does not intend to announce beyond the border of its Autonomous System, and it may even be considered in some weak sense, confidential information.</t>
        <t>A motivating application for this attribute is to convey information between Autonomous Systems that are under the control of the same administrator. In such a case, it would not need to be sent to other Autonomous Systems. At time of writing, work <xref target="I-D.uttaro-idr-bgp-oad"/> is underway to standardize a method of distinguishing between the two categories of external Autonomous Systems, and if such a distinction is available, an implementation can take advantage of it by constraining the NHC and its contained characteristic to only propagate by default to and from the former category of Autonomous Systems. If such a distinction is not available, a network operator may prefer to configure routers peering with Autonomous Systems not under their administrative control to not send or accept the NHC or its contained characteristic, unless there is an identified need to do so.</t>
        <t>The foregoing notwithstanding, control of NHC propagation can't be guaranteed in all cases -- if a border router doesn't implement this specification, the attribute, like all BGP optional transitive attributes, will propagate to neighboring Autonomous Systems. (This can be seen as a specific case of the general "attribute escape" phenomenon discussed in <xref target="I-D.haas-idr-bgp-attribute-escape"/>.) Similarly, if a border router receiving the attribute from an external Autonomous System doesn't implement this specification, it will store and propagate the attribute, the requirements of <xref target="receiving"/> notwithstanding. So, sometimes this information could leak beyond its intended scope. (Note that it will only propagate as far as the first router that does support this specification, at which point it will typically be discarded due to a non-matching next hop, per <xref target="receiving"/>.)</t>
        <t>If the attribute leaks beyond its intended scope, characteristics within it would potentially be exposed.  Specifications for individual characteristics should consider the consequences of such unintended exposure, and should identify any necessary constraints on propagation.</t>
      </section>
      <section anchor="considerations-for-the-elcv3-characteristic">
        <name>Considerations for the ELCv3 Characteristic</name>
        <t>Insertion of an ELCv3 by an attacker could cause forwarding to fail. Deletion of an ELCv3 by an attacker could cause one path in the network to be overutilized and another to be underutilized. However, we note that an attacker able to accomplish either of these (below, an "on-path attacker") could equally insert or remove any other BGP path attribute or message. The former attack described above denies service for a given route, which can be accomplished by an on-path attacker in any number of ways even absent ELCv3. The latter attack defeats an optimization but nothing more; it seems dubious that an attacker would go to the trouble of doing so rather than launching some more damaging attack.</t>
      </section>
    </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="RFC2545">
          <front>
            <title>Use of BGP-4 Multiprotocol Extensions for IPv6 Inter-Domain Routing</title>
            <author fullname="P. Marques" initials="P." surname="Marques"/>
            <author fullname="F. Dupont" initials="F." surname="Dupont"/>
            <date month="March" year="1999"/>
            <abstract>
              <t>BGP-4 Multiprotocol Extensions (BGP-MP) defines the format of two BGP attributes (MP_REACH_NLRI and MP_UNREACH_NLRI) that can be used to announce and withdraw the announcement of reachability information. This document defines how compliant systems should make use of those attributes for the purpose of conveying IPv6 routing information. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2545"/>
          <seriesInfo name="DOI" value="10.17487/RFC2545"/>
        </reference>
        <reference anchor="RFC4271">
          <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="RFC4760">
          <front>
            <title>Multiprotocol Extensions for BGP-4</title>
            <author fullname="T. Bates" initials="T." surname="Bates"/>
            <author fullname="R. Chandra" initials="R." surname="Chandra"/>
            <author fullname="D. Katz" initials="D." surname="Katz"/>
            <author fullname="Y. Rekhter" initials="Y." surname="Rekhter"/>
            <date month="January" year="2007"/>
            <abstract>
              <t>This document defines extensions to BGP-4 to enable it to carry routing information for multiple Network Layer protocols (e.g., IPv6, IPX, L3VPN, etc.). The extensions are backward compatible - a router that supports the extensions can interoperate with a router that doesn't support the extensions. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4760"/>
          <seriesInfo name="DOI" value="10.17487/RFC4760"/>
        </reference>
        <reference anchor="RFC6286">
          <front>
            <title>Autonomous-System-Wide Unique BGP Identifier for BGP-4</title>
            <author fullname="E. Chen" initials="E." surname="Chen"/>
            <author fullname="J. Yuan" initials="J." surname="Yuan"/>
            <date month="June" year="2011"/>
            <abstract>
              <t>To accommodate situations where the current requirements for the BGP Identifier are not met, this document relaxes the definition of the BGP Identifier to be a 4-octet, unsigned, non-zero integer and relaxes the "uniqueness" requirement so that only Autonomous-System-wide (AS-wide) uniqueness of the BGP Identifiers is required. These revisions to the base BGP specification do not introduce any backward compatibility issues. This document updates RFC 4271. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6286"/>
          <seriesInfo name="DOI" value="10.17487/RFC6286"/>
        </reference>
        <reference anchor="RFC6790">
          <front>
            <title>The Use of Entropy Labels in MPLS Forwarding</title>
            <author fullname="K. Kompella" initials="K." surname="Kompella"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="S. Amante" initials="S." surname="Amante"/>
            <author fullname="W. Henderickx" initials="W." surname="Henderickx"/>
            <author fullname="L. Yong" initials="L." surname="Yong"/>
            <date month="November" year="2012"/>
            <abstract>
              <t>Load balancing is a powerful tool for engineering traffic across a network. This memo suggests ways of improving load balancing across MPLS networks using the concept of "entropy labels". It defines the concept, describes why entropy labels are useful, enumerates properties of entropy labels that allow maximal benefit, and shows how they can be signaled and used for various applications. This document updates RFCs 3031, 3107, 3209, and 5036. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6790"/>
          <seriesInfo name="DOI" value="10.17487/RFC6790"/>
        </reference>
        <reference anchor="RFC6793">
          <front>
            <title>BGP Support for Four-Octet Autonomous System (AS) Number Space</title>
            <author fullname="Q. Vohra" initials="Q." surname="Vohra"/>
            <author fullname="E. Chen" initials="E." surname="Chen"/>
            <date month="December" year="2012"/>
            <abstract>
              <t>The Autonomous System number is encoded as a two-octet entity in the base BGP specification. This document describes extensions to BGP to carry the Autonomous System numbers as four-octet entities. This document obsoletes RFC 4893 and updates RFC 4271. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6793"/>
          <seriesInfo name="DOI" value="10.17487/RFC6793"/>
        </reference>
        <reference anchor="RFC7447">
          <front>
            <title>Deprecation of BGP Entropy Label Capability Attribute</title>
            <author fullname="J. Scudder" initials="J." surname="Scudder"/>
            <author fullname="K. Kompella" initials="K." surname="Kompella"/>
            <date month="February" year="2015"/>
            <abstract>
              <t>The BGP Entropy Label Capability attribute is defined in RFC 6790. Regrettably, it has a bug: although RFC 6790 mandates that routers incapable of processing Entropy Labels must remove the attribute, fulfillment of this requirement cannot be guaranteed in practice. This specification deprecates the attribute. A forthcoming document will propose a replacement.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7447"/>
          <seriesInfo name="DOI" value="10.17487/RFC7447"/>
        </reference>
        <reference anchor="RFC7606">
          <front>
            <title>Revised Error Handling for BGP UPDATE Messages</title>
            <author fullname="E. Chen" initials="E." role="editor" surname="Chen"/>
            <author fullname="J. Scudder" initials="J." role="editor" surname="Scudder"/>
            <author fullname="P. Mohapatra" initials="P." surname="Mohapatra"/>
            <author fullname="K. Patel" initials="K." surname="Patel"/>
            <date month="August" year="2015"/>
            <abstract>
              <t>According to the base BGP specification, a BGP speaker that receives an UPDATE message containing a malformed attribute is required to reset the session over which the offending attribute was received. This behavior is undesirable because a session reset would impact not only routes with the offending attribute but also other valid routes exchanged over the session. This document partially revises the error handling for UPDATE messages and provides guidelines for the authors of documents defining new attributes. Finally, it revises the error handling procedures for a number of existing attributes.</t>
              <t>This document updates error handling for RFCs 1997, 4271, 4360, 4456, 4760, 5543, 5701, and 6368.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7606"/>
          <seriesInfo name="DOI" value="10.17487/RFC7606"/>
        </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>
        <reference anchor="RFC9012">
          <front>
            <title>The BGP Tunnel Encapsulation Attribute</title>
            <author fullname="K. Patel" initials="K." surname="Patel"/>
            <author fullname="G. Van de Velde" initials="G." surname="Van de Velde"/>
            <author fullname="S. Sangli" initials="S." surname="Sangli"/>
            <author fullname="J. Scudder" initials="J." surname="Scudder"/>
            <date month="April" year="2021"/>
            <abstract>
              <t>This document defines a BGP path attribute known as the "Tunnel Encapsulation attribute", which can be used with BGP UPDATEs of various Subsequent Address Family Identifiers (SAFIs) to provide information needed to create tunnels and their corresponding encapsulation headers. It provides encodings for a number of tunnel types, along with procedures for choosing between alternate tunnels and routing packets into tunnels.</t>
              <t>This document obsoletes RFC 5512, which provided an earlier definition of the Tunnel Encapsulation attribute. RFC 5512 was never deployed in production. Since RFC 5566 relies on RFC 5512, it is likewise obsoleted. This document updates RFC 5640 by indicating that the Load-Balancing Block sub-TLV may be included in any Tunnel Encapsulation attribute where load balancing is desired.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9012"/>
          <seriesInfo name="DOI" value="10.17487/RFC9012"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="I-D.haas-idr-bgp-attribute-escape">
          <front>
            <title>BGP Attribute Escape</title>
            <author fullname="Jeffrey Haas" initials="J." surname="Haas">
              <organization>Juniper Networks</organization>
            </author>
            <date day="20" month="September" year="2024"/>
            <abstract>
              <t>   BGP-4 [RFC 4271] has been very successful in being extended over the
   years it has been deployed.  A significant part of that success is
   due to its ability to incrementally add new features to its Path
   Attributes when they are marked "optional transitive".
   Implementations that are ignorant of a feature for an unknown Path
   Attribute that are so marked will propagate BGP routes with such
   attributes.

   Unfortunately, this blind propagation of unknown Path Attributes may
   happen for features that are intended to be used in a limited scope.
   When such Path Attributes inadvertently are carried beyond that
   scope, it can lead to things such as unintended disclosure of
   sensitive information, or cause improper routing.  In their worst
   cases, such propagation may be for malformed Path Attributes and lead
   to BGP session resets or crashes.

   This document calls such inadvertent propagation of BGP Path
   Attributes, "attribute escape".  This document further describes some
   of the scenarios that leads to this behavior and makes
   recommendations on practices that may limit its impact.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-haas-idr-bgp-attribute-escape-02"/>
        </reference>
        <reference anchor="I-D.ietf-idr-next-hop-capability">
          <front>
            <title>BGP Next-Hop dependent capabilities</title>
            <author fullname="Bruno Decraene" initials="B." surname="Decraene">
              <organization>Orange</organization>
            </author>
            <author fullname="Kireeti Kompella" initials="K." surname="Kompella">
              <organization>Juniper Networks, Inc.</organization>
            </author>
            <author fullname="Wim Henderickx" initials="W." surname="Henderickx">
              <organization>Nokia</organization>
            </author>
            <date day="8" month="June" year="2022"/>
            <abstract>
              <t>   RFC 5492 advertises the capabilities of the BGP peer.  When the BGP
   peer is not the same as the BGP Next-Hop, it is useful to also be
   able to advertise the capability of the BGP Next-Hop, in particular
   to advertise forwarding plane features.  This document defines a
   mechanism to advertise such BGP Next Hop dependent Capabilities.

   This document defines a new BGP non-transitive attribute to carry
   Next-Hop Capabilities.  This attribute is guaranteed to be deleted or
   updated when the BGP Next Hop is changed, in order to reflect the
   capabilities of the new BGP Next-Hop.

   This document also defines a Next-Hop capability to advertise the
   ability to process the MPLS Entropy Label as an egress LSR for all
   NLRI advertised in the BGP UPDATE.  It updates RFC 6790 with regard
   to this BGP signaling.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-next-hop-capability-08"/>
        </reference>
        <reference anchor="I-D.scudder-bgp-entropy-label">
          <front>
            <title>BGP Entropy Label Capability, Version 2</title>
            <author fullname="John Scudder" initials="J." surname="Scudder">
              <organization>Juniper Networks</organization>
            </author>
            <author fullname="Kireeti Kompella" initials="K." surname="Kompella">
              <organization>Juniper Networks</organization>
            </author>
            <date day="28" month="April" year="2022"/>
            <abstract>
              <t>   RFC 6790 defined the Entropy Label Capability Attribute (ELC); RFC
   7447 deprecated that attribute.  This specification, dubbed "Entropy
   Label Capability Attribute version 2" (ELCv2), was intended to be
   offered for standardization, to replace the ELC as a way to signal
   that a BGP protocol speaker is capable of processing entropy labels.

   Although ultimately a different specification was chosen for that
   purpose, at least one implementation of ELCv2 was shipped by Juniper
   Networks and is currently in use in service provider networks.  This
   document is published in order to document what was implemented.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-scudder-bgp-entropy-label-00"/>
        </reference>
        <reference anchor="I-D.uttaro-idr-bgp-oad">
          <front>
            <title>One Administrative Domain using BGP</title>
            <author fullname="Jim Uttaro" initials="J." surname="Uttaro">
              <organization>Individual Contributor</organization>
            </author>
            <author fullname="Alvaro Retana" initials="A." surname="Retana">
              <organization>Futurewei Technologies, Inc.</organization>
            </author>
            <author fullname="Pradosh Mohapatra" initials="P." surname="Mohapatra">
              <organization>Google</organization>
            </author>
            <author fullname="Keyur Patel" initials="K." surname="Patel">
              <organization>Arrcus, Inc.</organization>
            </author>
            <author fullname="Bin Wen" initials="B." surname="Wen">
              <organization>Comcast</organization>
            </author>
            <date day="24" month="February" year="2025"/>
            <abstract>
              <t>   This document defines a new External BGP (EBGP) peering type known as
   EBGP-OAD, which is used between two EBGP peers that belong to One
   Administrative Domain (OAD).

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-uttaro-idr-bgp-oad-06"/>
        </reference>
        <reference anchor="RFC4786">
          <front>
            <title>Operation of Anycast Services</title>
            <author fullname="J. Abley" initials="J." surname="Abley"/>
            <author fullname="K. Lindqvist" initials="K." surname="Lindqvist"/>
            <date month="December" year="2006"/>
            <abstract>
              <t>As the Internet has grown, and as systems and networked services within enterprises have become more pervasive, many services with high availability requirements have emerged. These requirements have increased the demands on the reliability of the infrastructure on which those services rely.</t>
              <t>Various techniques have been employed to increase the availability of services deployed on the Internet. This document presents commentary and recommendations for distribution of services using anycast. 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="126"/>
          <seriesInfo name="RFC" value="4786"/>
          <seriesInfo name="DOI" value="10.17487/RFC4786"/>
        </reference>
        <reference anchor="RFC5065">
          <front>
            <title>Autonomous System Confederations for BGP</title>
            <author fullname="P. Traina" initials="P." surname="Traina"/>
            <author fullname="D. McPherson" initials="D." surname="McPherson"/>
            <author fullname="J. Scudder" initials="J." surname="Scudder"/>
            <date month="August" year="2007"/>
            <abstract>
              <t>The Border Gateway Protocol (BGP) is an inter-autonomous system routing protocol designed for Transmission Control Protocol/Internet Protocol (TCP/IP) networks. BGP requires that all BGP speakers within a single autonomous system (AS) must be fully meshed. This represents a serious scaling problem that has been well documented in a number of proposals.</t>
              <t>This document describes an extension to BGP that may be used to create a confederation of autonomous systems that is represented as a single autonomous system to BGP peers external to the confederation, thereby removing the "full mesh" requirement. The intention of this extension is to aid in policy administration and reduce the management complexity of maintaining a large autonomous system.</t>
              <t>This document obsoletes RFC 3065. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5065"/>
          <seriesInfo name="DOI" value="10.17487/RFC5065"/>
        </reference>
        <reference anchor="RFC5492">
          <front>
            <title>Capabilities Advertisement with BGP-4</title>
            <author fullname="J. Scudder" initials="J." surname="Scudder"/>
            <author fullname="R. Chandra" initials="R." surname="Chandra"/>
            <date month="February" year="2009"/>
            <abstract>
              <t>This document defines an Optional Parameter, called Capabilities, that is expected to facilitate the introduction of new capabilities in the Border Gateway Protocol (BGP) by providing graceful capability advertisement without requiring that BGP peering be terminated.</t>
              <t>This document obsoletes RFC 3392. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5492"/>
          <seriesInfo name="DOI" value="10.17487/RFC5492"/>
        </reference>
        <reference anchor="RFC7705">
          <front>
            <title>Autonomous System Migration Mechanisms and Their Effects on the BGP AS_PATH Attribute</title>
            <author fullname="W. George" initials="W." surname="George"/>
            <author fullname="S. Amante" initials="S." surname="Amante"/>
            <date month="November" year="2015"/>
            <abstract>
              <t>This document discusses some existing commonly used BGP mechanisms for Autonomous System Number (ASN) migration that are not formally part of the BGP4 protocol specification. It is necessary to document these de facto standards to ensure that they are properly supported in future BGP protocol work.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7705"/>
          <seriesInfo name="DOI" value="10.17487/RFC7705"/>
        </reference>
        <reference anchor="RFC8277">
          <front>
            <title>Using BGP to Bind MPLS Labels to Address Prefixes</title>
            <author fullname="E. Rosen" initials="E." surname="Rosen"/>
            <date month="October" year="2017"/>
            <abstract>
              <t>This document specifies a set of procedures for using BGP to advertise that a specified router has bound a specified MPLS label (or a specified sequence of MPLS labels organized as a contiguous part of a label stack) to a specified address prefix. This can be done by sending a BGP UPDATE message whose Network Layer Reachability Information field contains both the prefix and the MPLS label(s) and whose Next Hop field identifies the node at which said prefix is bound to said label(s). This document obsoletes RFC 3107.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8277"/>
          <seriesInfo name="DOI" value="10.17487/RFC8277"/>
        </reference>
        <reference anchor="RFC8955">
          <front>
            <title>Dissemination of Flow Specification Rules</title>
            <author fullname="C. Loibl" initials="C." surname="Loibl"/>
            <author fullname="S. Hares" initials="S." surname="Hares"/>
            <author fullname="R. Raszuk" initials="R." surname="Raszuk"/>
            <author fullname="D. McPherson" initials="D." surname="McPherson"/>
            <author fullname="M. Bacher" initials="M." surname="Bacher"/>
            <date month="December" year="2020"/>
            <abstract>
              <t>This document defines a Border Gateway Protocol Network Layer Reachability Information (BGP NLRI) encoding format that can be used to distribute (intra-domain and inter-domain) traffic Flow Specifications for IPv4 unicast and IPv4 BGP/MPLS VPN services. This allows the routing system to propagate information regarding more specific components of the traffic aggregate defined by an IP destination prefix.</t>
              <t>It also specifies BGP Extended Community encoding formats, which can be used to propagate Traffic Filtering Actions along with the Flow Specification NLRI. Those Traffic Filtering Actions encode actions a routing system can take if the packet matches the Flow Specification.</t>
              <t>This document obsoletes both RFC 5575 and RFC 7674.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8955"/>
          <seriesInfo name="DOI" value="10.17487/RFC8955"/>
        </reference>
      </references>
    </references>
    <?line 398?>

<section anchor="falsepos">
      <name>A Case Where a Link-Local Next Hop Could Lead to a False Positive</name>
      <t>Consider a simple BGP peering topology, with four routers, in three Autonomous Systems:</t>
      <figure>
        <name>A Trivial Peering Topology</name>
        <artset>
          <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="144" width="248" viewBox="0 0 248 144" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
              <path d="M 8,32 L 8,96" fill="none" stroke="black"/>
              <path d="M 48,32 L 48,56" fill="none" stroke="black"/>
              <path d="M 48,72 L 48,96" fill="none" stroke="black"/>
              <path d="M 64,32 L 64,56" fill="none" stroke="black"/>
              <path d="M 64,72 L 64,96" fill="none" stroke="black"/>
              <path d="M 168,32 L 168,56" fill="none" stroke="black"/>
              <path d="M 168,72 L 168,96" fill="none" stroke="black"/>
              <path d="M 184,32 L 184,56" fill="none" stroke="black"/>
              <path d="M 184,72 L 184,96" fill="none" stroke="black"/>
              <path d="M 224,32 L 224,96" fill="none" stroke="black"/>
              <path d="M 8,32 L 48,32" fill="none" stroke="black"/>
              <path d="M 64,32 L 168,32" fill="none" stroke="black"/>
              <path d="M 184,32 L 224,32" fill="none" stroke="black"/>
              <path d="M 40,64 L 72,64" fill="none" stroke="black"/>
              <path d="M 104,64 L 128,64" fill="none" stroke="black"/>
              <path d="M 160,64 L 192,64" fill="none" stroke="black"/>
              <path d="M 8,96 L 48,96" fill="none" stroke="black"/>
              <path d="M 64,96 L 168,96" fill="none" stroke="black"/>
              <path d="M 184,96 L 224,96" fill="none" stroke="black"/>
              <polygon class="arrowhead" points="200,64 188,58.4 188,69.6" fill="black" transform="rotate(0,192,64)"/>
              <polygon class="arrowhead" points="168,64 156,58.4 156,69.6" fill="black" transform="rotate(180,160,64)"/>
              <polygon class="arrowhead" points="136,64 124,58.4 124,69.6" fill="black" transform="rotate(0,128,64)"/>
              <polygon class="arrowhead" points="112,64 100,58.4 100,69.6" fill="black" transform="rotate(180,104,64)"/>
              <polygon class="arrowhead" points="80,64 68,58.4 68,69.6" fill="black" transform="rotate(0,72,64)"/>
              <polygon class="arrowhead" points="48,64 36,58.4 36,69.6" fill="black" transform="rotate(180,40,64)"/>
              <g class="text">
                <text x="24" y="68">A</text>
                <text x="88" y="68">B</text>
                <text x="144" y="68">C</text>
                <text x="208" y="68">D</text>
                <text x="20" y="116">AS</text>
                <text x="40" y="116">X</text>
                <text x="108" y="116">AS</text>
                <text x="128" y="116">Y</text>
                <text x="196" y="116">AS</text>
                <text x="216" y="116">Z</text>
              </g>
            </svg>
          </artwork>
          <artwork type="ascii-art"><![CDATA[
 +----+ +------------+ +----+
 |    | |            | |    |
 | A <---> B <--> C <---> D |
 |    | |            | |    |
 +----+ +------------+ +----+
  AS X       AS Y       AS Z   
]]></artwork>
        </artset>
      </figure>
      <t>Suppose A and D support NHC. B and C do not support NHC. In this case, when A originates a route with an attached NHC, if B propagates it to C, and C updates the NEXT_HOP when propagating it to D, D will follow the procedures of <xref target="receiving"/> and will discard the NHC without further processing.</t>
      <t>However, now suppose that on the peerings between A and B, and between C and D, only link-local addresses are used. Further, suppose that A uses link-local address L as its local address on its peering with B, and C also uses the same address, L, as its local address on its peering with D. In the situation described in the previous paragraph, D would have no way of detecting that C had violated the correctness assumptions of this specification, due to the collision between its address and A's.</t>
      <t>It can be seen that since the scope of a link-local address is, of course, only the local link, the problem to be solved is restricted to knowing whether an immediate peer whose link-local address appears in the NHC is truly the originator of that NHC, or if it might be an NHC-incapable speaker that has propagated an NHC that originated elsewhere, with a colliding address.</t>
      <t>It can further be seen that if the procedures of <xref target="bgpid"/> are followed, this issue is resolved since A will attach a BGPID TLV containing its own BGP Identifier and its AS Number, X. Even if C's BGP Identifier is the same as A's, its AS Number is different, and thus D will discard the NHC without further processing.</t>
    </section>
    <section numbered="false" anchor="Acknowledgements">
      <name>Acknowledgements</name>
      <t>The authors of this specification thank Randy Bush, Mach Chen, Wes Hardaker, Jeff Haas, Susan Hares, Ketan Talaulikar, and Gyan Mishra for their review and comments.</t>
      <t>This specification derives from two earlier documents, <xref target="I-D.ietf-idr-next-hop-capability"/> and <xref target="I-D.scudder-bgp-entropy-label"/>.</t>
      <t><xref target="I-D.ietf-idr-next-hop-capability"/> included the following acknowledgements:</t>
      <artwork><![CDATA[
    The Entropy Label Next-Hop Capability defined in this document is
    based on the ELC BGP attribute defined in section 5.2 of [RFC6790].

    The authors wish to thank John Scudder for the discussions on this
    topic and Eric Rosen for his in-depth review of this document.

    The authors wish to thank Jie Dong and Robert Raszuk for their
    review and comments.
]]></artwork>
      <t><xref target="I-D.scudder-bgp-entropy-label"/> included the following acknowledgements:</t>
      <artwork><![CDATA[
    Thanks to Swadesh Agrawal, Alia Atlas, Bruno Decraene, Martin
    Djernaes, John Drake, Adrian Farrell, Keyur Patel, Toby Rees, and
    Ravi Singh, for their discussion of this issue. 
]]></artwork>
    </section>
    <section anchor="contributors" numbered="false" toc="include" removeInRFC="false">
      <name>Contributors</name>
      <contact initials="W." surname="Henderickx" fullname="Wim Henderickx">
        <organization>Nokia</organization>
        <address>
          <email>wim.henderickx@nokia.com</email>
        </address>
      </contact>
      <contact initials="J." surname="Uttaro" fullname="James Uttaro">
        <organization>Independent Contributor</organization>
        <address>
          <email>juttaro@ieee.org</email>
        </address>
      </contact>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+V96XbbRpbwf53jd6iP/mFpmuTxvvUykSW7rUSRNZIy6Z45
c3KKRJFCBAIcFCBZsZ1n+Z5lnmzuVhsAynI6mdMz7e7YJAHUcuvuGyaTyZ0t
2+gy+0EXVWleqqZuzZ2tfF3TR9s8vH//xf2Hd7bmunmpbJPB7e1slVubV2Vz
vYYnDl6fvbmzpWujX6q6Wd7ZulrCj2Vj6tI06nW5zEtj6rxcqjNtL9Sbqp7D
DO06042xL9XTZy/uj9Wzx4+f3dm6s5VV81KvYNSs1otmkptmMcmzemLKpq7W
15NCz0wxeUD3NnlTwJ2v/nysjsz7Rr2t1mrfrE2Zwd1q71zXeg6ryG2Tz63a
bZo6n7WNwUf1bFaby5fq6O3ena1Cl7BiU97Zurh6eWdLqYmaLdf8oTyf8wdZ
gKIFwABtc17VcPdE1RWuwmR5U9V4L6//Vd2WFSxnXmtTGvy9qmGWdzVMRl/N
SufFSzXD+6aZ3PdVRden82rVHVqFsb+uzkv156k6nbdZZmo/+Ndtma9NDdBo
rqr6wkbT/Li0X/3Il6dwLDg4j/VNXhvT5OqbarU2RaFvM9gFPzM84KlurrX6
tjrXgB9+tH+zc13wUmUQu+JbvvqJL7k9C/jyUn2PRyLP71WrubZN9Dzc8QPc
8dWcr6SPf2MucQCA5a32s7iCOzdsx9RLo76p8wjOe7mdV+r02jZmFY9jzQXe
99Ucr/OC5kAlhHaALCqM+n2+Um8RUet8fvHeD3xUXeQ6GvAqX03P/W1flXg5
3ejX8LdV3zWNris/zAE84ckgLCBGh5ae+Co3xkzhGaSJsqpXuskvDdHAyZu9
hw8evPCfnzx+4j4/fvjsgf/87Ol99/npw+dP/Weg6ujzI/cZ6dx/fnrf3//8
wbPHL5WSby/uP3gIV/JykazpYLI/PdfaEkcAEp1oR9MTA0i0Dnd5vlECY5ic
V+sJXNazvMiba3+TZfKhkRL+4u9gKPnpKp2FfYe9Prn/1MPmyeMXD/3+nt33
vz9/+Mzv+/mLJ/w7HONkovTMNsip8AzgqsIhlC6K6soqTdzNro2+ANRtKqWz
S1M3uTUqb6zym8oBCeAq/rYGZjtV3wPawNN1BcBROfwKu9NL4LiZmpnrqsxU
cw4XVitgLvArPTWG5/He1ppFW9BsuAo1hxk1kNO8w1HhhplRgOGX5hrGXbQ1
jAlzA/6ptYZVzttCD43q9wDHe6XrDGXDGrgw/GB009bGThEYZ+fwGOx9ni9y
ED8gcFRmFiBNHFwAbKXNET2UxwScYK7r+lrZdn6uPApV5Zi2PPoSUTEeAUGh
kJiq78oivzA0RAJ1XhFA9Vq5w+OJutDycAJI4nUYVen1uoCFApeHf2Dh+Dsd
mQ1AoqHxAu74u+P93bPX8FU3OCAei6WLAd603A3g04WtAgxLWkO6ThkarsHR
tjh7cmA4lZARXgCsmhvLK/j2+PAUpD1LyUMkI6VpErOs8Z7D0xM8b8QpdXR4
chDvUEASdohI1CjREQiwyFBgtIy+IBfB/QNmlog8DW6VKCVflrqAnwgCSF2r
PMsKkvl3USmpq6ydEyw+3M3x6ye89OGDkO6nTxHlVTVwB/VnWMKVvlbHddVU
86pQ2zDRzv8BmlzBpviQf226rNb4oy5+ewIdjT2B4spOc0AJT12wSjhiHCID
OOVmAUSGGMjQwc1FkwNaw7ls3jmBDBTZzMG4NktQ2Go6vis4WXOJ2CBYTGd8
zyoUPwrED64FjgpUuwzUNlpldUWYy0SPqICwBxBWi428zTKiA3Xea3AJyxbA
AjuEFWwDoeFma4c8tIKayTmrjMVH8tW6MCsEaNM/wquqLRARlXkPvzdM+R5F
A8uCFa71f7ZGAW3qnbG/YMp5lRnmBX7bsBnE/6rOwQrQoIPQeXk2J+tbVbYB
eM5hZXBETPVMDH7rU3Ww8FOttbU0EwyyPHckJYMxmDvruMpBXW+bcGjMNWg4
2sI13AKMaQHaEe4bcAJwE48VFH4c2rzXK+TzY+JBtAEA3jpHYCK3BOyE/+YV
oU5xPVVMJPNzgLdjKbh0267XVd0IDuXCkIgFIgXCikk7ha/zmo4KnoXRDhhR
4TMDnPCaGAPueUzMDiHkQQFXykqA4fbqoEGojIuuZkV+mVetBaj3T/pHsP4U
CT1dXqsK+cjNlD0dWMSGBTQIWVjFuXbkpGcFsYbLCrkCkikS1HVXPCE3LOdF
i5gWBCmxJTARAL1hA5kB1lgAM6qJsC7zjEXMhw/NrJ5/+kR374r0A06U82Wt
lrCdMpazoFtbvXT81Cb8gpCtNgVJKObLzrYA8XcN2z8xGlYv0vIgenQb5d9O
TwDCeJEY5yUwvlWl0w8q4M749FTtqixfLEyNeNBZriO3oDtYMBNAz2jB9AaJ
uDxvCDsEkqIJ8FT5Au4bs4SOgEOrk2mYU+AAeG6whnk0E/HiV9fEa4S1jHFQ
jxRXuT1niLWWEa1BncTOAYlM0A7goP02Osw3XTbRtkJQu/XBvRa4vmWZEJOO
7qETD5WcP5HpebxH5B0IM+BmqNJ0B6kWHeyeIafRRDCbbl7D5bFwZxJzwCTL
RL3qjIobd8wjb6ZoPc6NKAdW55mQ0ShYflU5SkZgcPwirXAMqFAUAKbR68O9
y0cgdW+tFbZFk6+d6sRq4SmcGMhjYArbqDTu3Kg1dp44YSTaBm1y55eqk6Tt
oT6J2h6gPH1HlRK+EzKBlAAdgAmuq1iO+Tf4v+hWQIZgSFrreIwp5pePgMmo
3YLxRhHM8AkiY2AZ5lKXJAJo4XDQZHXCADrLaNcLEDZFjnivYRrUP4ZUdSZk
JJo10Zpw0LIqJ25AnIBFLmBHhSiX1zADCnhk3W5qIJXtM4AY6g9qNLia6xHu
wFk7AuFFXltiWnpZ6/U5jndqWL1+NH2CXwm2aM4jRA5KBl5WzVuUbWN1Rfon
jZXOjQsfMbUBLdakmK1wwJGDmR6G2vV0tEPa/l3gv//Z5ixFEZFKUJeWhmnA
qAsU+SCurRp9+93pGaA0/auO3tHnk9f/8t3Byet9/Hz6dvfw0H/YkjtO3777
7nA/fApP7r379tvXR/v8MPyqkp+2Rt/u/nXEzHb07vjs4N3R7uGIIRrBhqSX
1xJMva4NcllttxyvpFN4tXf8X///wWOA8/8Tjw0gMX9BlwpiNIjaSIrwV9R4
tgBtDAgaZH1ARGC35KBtIM5ZhPlVqQC7zXRr65/+HSHzHy/VH2bz9YPHf5If
cMPJjw5myY8Es/4vvYcZiAM/DUzjoZn83oF0ut7dvybfHdyjH//wz0DeRk0e
PP/nP22xvfilnmWwKUnDEPx7jRpxXi4dyt1yuGApbZPC7Z0RSMeklMHPO0iN
qMKJQjaONTKcCAVMNBTxNfTXK9TS1aMXqKGKRl+AeWuDWhWU0ILUGEdeOa42
X1x3tTknqdiu9XYCKMOrtS6Bi4WpmIuC5Vuh+pqjUHb2Z6xasVaVOePoBpvM
ViICYeF57TjgCixz/D0CCfxqStuyRkiKLkm+eV1ZG/vYrNo20+V0LLupwWgE
hlbVdseZUkGvNikYkMSIaJFsYM1GdKzeHuBkGCT+UTSlSJn3qwRLAgyMpiTA
L2QzIODQ7kmWG6+qRU8xRXOCKnbWkVZg3RWaPVYGrJKpQ86AxPu4mEVuQP+p
gs0VUAkGY1svY/58bjT6SVAz8Xqx4Eoudlhin9WGDheQ+RZ23xggh9YTK5hV
afg5gNAZIPPk0JTL5nzyr7oAg3T77PBf4ZjqHMwA+xI39vPPPyut7SVFAZS6
r/p/Hgz89nDgt0duiAdw+ZF6rJ6op+qZeq5efMlvNMjvJn/j/2iUj/DfrpDm
G5J86sBBvZbrSp3uvjngDXwMvAegBt9lLTf/6V7vffdr+Vv+8Fp+Tn5ztpTb
I+Ci38D2pa5zpPad+Imff8W1fA4un/vz28EF/6QiQwHe2w0wwT9/Z3ABoryz
9eGlovDtH+8hc3lDrP+euluez1kMfHJ8aWU0unit40XCbYg/waY3UsCYUR+4
xWk7s6AJoqi94W7mJDGWsdJ0AxruELsHHsh2I3B6r/x61RfjY+JxQO23rUH5
Ilu1c4QozfEc/yHYluph8B4qJYxmg9fldG6Nhp+9/luSZ2ftIpz+l5Jnn9U4
aiUSHTjHl4DJQDOTCn5GnQSVPnZwmqVTAvIyQ++DqAeklwLFdOzbyKJHSmxL
vZrly5b9lZGGQa7vLL/Ms1YXnUGmA4tkZPryZRb03BgJnR4C/VOY0uCJE4ua
gpCWB/Hm+8mQuvnM08gWfjJ1NfFTT83U+U1BT2/BbrvE24e2SePgLh3mySh+
YQeNC5F469J5sJ3qTYNv2CWeNfuUdpMotbMNvZ+O1DXYbUn6W16ihjo3bMN3
jpzNFOewHJhwPMwZmFcPAQD2eVShHgkWLXqUxekmPirc6opcVEVYGTF5Ck71
1oeRFFK1a/YtsCcNsA52l7F7CE8my3Lxk4cx+5aDiDYHXl2WVVvOKVgVT/p7
uNqSK6gH5RmaM2YNYojjtPO5WTe89P6uCEcS2wGs4l9ySNvaBvLzjt+Bw9rh
8wx+6g0HdBwOg2Fhu+HzCI6R+9Jh6ZAwQXxwMEo8JviAd7K4AEywaa9uwUBI
3/IHUOh5GtXPSw7faN4RRZFhX4Pks33AzwFqluRgHsbGLycUxMPgmdSz6hJo
oKy8HWjRXPPLi1x75PQBIeXdl4Sq+sdq4JkVQBlttjHxYBddZNua4GPQehY3
Voyp8wrM3FU/SQJ9URhswgnG5N+tq1lr2Q5GiMJzU3GvnJoyi8J46sNdy7+Q
YDpFXzngUUo1p8I52bo/QVYa4hHBoU3Q9db5URLGJ1VuASPlIa5JnmkO4cFs
FK2IaUt86h1vTN6MXbYFhlls94gJyyRC4KIj5LkljDiZwhIIxtY0qSMiM+uc
QjKCkx0DPTLq+WCAlWmKeh6NVWsdSI14r0S7JQwKm0cwouUO1zLY+qKuVoAe
cKIcJ4xgPkYpC5MDffu0CPMetjhVb9B9DIo6oIPEnr1zhgDqorY+iHgkPmQC
mjX4qOfIGB4ihqAlYulYs55LEKpR4lG0iKpDIU9gvxykh08FopwPlKCnCpB2
AfoHojDtEjAH49JlZpACrmDvYGjUl8ZJdna8AM0FBkhwIg5kFhooXRbXzfOC
vy0jCaBOWwKgq2WZ/4QT35haMZmIO6wRJ0sarSemGLJO6DTBZKnKLDkED25E
aT7VK30t4cFeGkn/sSMK1jOOOHgeEU04zeAGyE9RLZFz8vSDfLm4niDXaOqW
cHuAoE7GKr5D24jxE/o6ghgN0+2IkGqqdgF5GOn7FOljoiL1PrcwjtFgjCN2
cHo08CSUPoUCtly3jWM8fnxCZKYlQEh01AMe4BTiX5QfGb/n1do7a2Hp7HN0
wXHgAqARDWaqCZRQFtKyyB0ZwdWpPZEEJuGRO/ZCBm5nVAbrEIvzMACQnjLt
4BSUqdNZGdK5BEHd/ZS2IXHaOJp7m8M5DU5vRiCXGdARZYKOA8kwSBF8Pg07
VbsrhjUKqSMANg+MSQqewfBFSh2uCgTo1bnhaPImzEyyyYZmQnHkpkE5X0+W
tazYTVMmrvGZRr0BWVPIPnKxa0nnt4aqAMapqkFBUOAqbZ031z8AlMT9sd8a
hy0lue9dptMQS0ujF6j8ws4TFunymtjJfmNiE2JI7+zGQn9RiJC2h4+LFwdG
RrQghzqmFKpTtgncGjzqsec6jCymBquOkqhHYUvmAN4WiPmbCyI0GIwbkxKO
OUeoCc6Mo+I3mPp3muyOxiVXE6YVY5TVBVs8twXKsAgbwnEyDiiDhNWou+ow
Ly8mhxXIuMk7jBA695YFjaooyvNP4rwiQYAc0o59eN2BQjQvr1kx2+MwAccd
tSpwngLn8SElpB+Qj8uimoVfScY784ukvMbjAwN2BYwhxwjIzMy1xI1rI0KW
09a040EyZlvm6PoTzx2PWrqZQjLXyBrQZSmojplfoy4+M49C3fKTCLxrk8Pf
Wi10AQsBlkyIy6RXFC3yZVoKU2aUg0QPwP1CFmcVAKvJBTX5btyqJM3EQA75
MB7OV5QQ5LEHJW6AJwrqsZe7AdlgzIN9EmbbHz7Mlus8+/Rpx6PD7nKJ+Q+S
I1uez3X4gVCB01jdj3DonLE8ljQQlLN1C9qTy7UUyUXY4WSKM55ccMfJpnlu
5fwcy4vyfRzX9baPW4SLPeJpXpHfprGcMEAkOgMUckk2OTthkbHFTLXLtlEA
mQLALRHFWLhsmh49KgtBSU3RvzBEZ/yQNRkTqZvBx+RSPkbZLje4usB0tI2Y
cSLbOR2yIygk384tPiNtDRbLh4Yrd6YgzTgocMaDg8ebicc/8egQow2CgFNj
WNy3ZZxBE2PdJ3YzbZ/wKUcImtvUuGef+8NnD5IEHLA8F/n75EHQlOfVapZz
+jgYKC6siH9NvHrDT7J5yBkoJfoBre3eQqq3pcuSjeMYUTQrGQnA+MVC0CUb
S/AcZZrGy5AqgIVky5KV77aB+hcZ1sZlfVGiPt7L3gMUniHgPA35MMLEIpM5
MLZh1cdfdytiq4SeDvkZxC4pZSqO3eJm/o60I3Qx/b0qR1IaEHN7UYtdTr3L
rtBRAqxXOByPp5SLWhLyRMb64NTNrgBSZZ3gcisN4bhPXnfrZH34tfkMbURj
kqKBy0mpgfM9RYcRPSNKkTyKBQoG9EFWO5LU9p4eSM5XyRyQ6orSaZOU9hY0
RZdC6fNdnYG6MaMlpK2xMkIWU0X51zYG4Bz9t42jxqBaxOJOyESECNUbpCAh
D7J5T25cHx/wsyGewihFtSRDWfQyFLF5xljnpWa8mxGB1FhMOlOpokPeVEpu
xfKUHJXNvJnAmU/gX3YMYVInRScB0y/RnwLIzp5KzTmZY5F5csi+MgU1RVyQ
4CMesZakmN4knDMLxArimpc7IkJ1KrBjkSD/vj3+4eT17t7bkA3gKg/opLXX
JjEdJ1Y6D44vnyY6ZuRHovBOXz/1GZZgIlRoomYtgZmrm+FGRMXtAyoIivjD
2G+YU6V5X1yXQ0fFjFtOgFDoGkRD7VxxkgkcqXFgexgzEF7GskzJrGRZIvr5
ZpXbbwmkCVoFIUOow6VI9f/0e3IBBWXcI2zszsitM6S4aARINW8S/BicQVTP
aT+EFKSOHvRtMxv01IwGwbkmXtlLUfWufnZRiPAb9MWrX7aIHm9hdXtZSkSl
F/aQ2ToVWd4dtOZE847jb2gFsb7leKBkT9d1VXs9ko96QzQnkuJwpkVLNzIX
ZS2DBEUtP6EOgq7MORCN+EibtixNQeVU1pcM1uQDcgIiKfwIygsPiUbLzGCl
jdE1qZ3oHXv9PiYxhrXozXFRFeXtB//qbttUZbWqWivl2TuUNTm77mgP29Y4
4wMWvkOnwW7cXIKiiguFCtQV2N9mRB8u6fArdVE6HRvTZ70crL1U6C1Gbe+e
7rBNEqXqbdKwpRojbM4Nj7KDAiVq95TZhhRTxJAIByXLpqfHcSJiUaGRz+Ys
YAi6o7/8SKfqjQMj0zlHaYjucwlsZiugPFIsqjrUNUihk+Wjydh7I9DsbJWg
Kb4+H69mdStC7b4v0zEBUp/Jh02s1m250O/dmmF1OaN6F1dcuCkkSL5G4lJv
JeIbFRPxXhyHX+kCWaTJHBxCGkAnxdGlU7qd+pkOo4B9rHAdo4YfbhOtbtvJ
h8fTKAGJjCEgA8JqWp5tvDcoLMtj7SZtnZy1kaSh5Hkh6HblnrbArKzaHk7f
WYN6qR7v3GqmMd/dhxsC2m040VBhj2QBxxEtfAAEd4041QVrJHc69VNi44QD
ZGsH09YjThtCZWDx1RUSB9YnBPNHtL1RLJK41uTp/aci974rkY2UQ+zdJvw9
VR1mJuXygoBpXTjY9EP+dtEihzAVmI6zmZkPSkQrC8ooEpzY2yR0cybpoW2T
K5W1TYqfDUXCNAk7HAdgCTdw0NPXEJFfyLv4mLWkdan69juXA/caAT0jdrzk
vbN3qnMYUgzmLERn+VupE2K9m6eH+xsu35fTEQteNwMDu2hqTySja46i6/5Y
hrwteJcIb3Qekb7BmVKirYJUe8dK4QAWhCe9NYa6Q2uBcqZcxbkxBibKno2O
kzY7cVkwHH90QC77CRiARVR4So5p5N9U4tf13G8CvGPJLjfz3dqIXN8TpKZv
1mVdEq8B1YLVY7FJfKJFSbTmypBIVBwcBxc18aC87ugxrBL7IO01tqCRkfSg
T+rZcyD5wSQeJPCQerAB7CKYNUUccBYL173M7S7aVxmf5920Ald5wJCrCHJI
wutQFU1pE8mWWESuEbhOD6I6Bb6fXFnJE0EnjjfW2VIvmLdhc25gb7rRDtg5
QKoNVZoUuT0Pj9Qmbqlg59Xa+PCOo3/Gok7xYYf0t8lBuaM+3OWyPqdRY3nH
smI/D8lcZ3cEfwoVioqEqweimSJPcbQblyBeRUK4gdQk8hwhTkXS3mttOGuG
mhdyZlL5ovK6LqJyvo1Y3GOJKT189gzRNnhW0MqPHfLiwbVky0QyWo6JbrXe
19RDRydrndumlxwpdaBOabK2mufkoIorQ+ErqUTbh6dgiWNpu6tBTdp22eGO
JFzJXUkChY0M7cfTB16R4oLRqXqFZTPkySUN21eJ4kjYVAz9JWTRILxHrw+5
81BhpiM8rjdwF9wNJIdC0aU0jQdBQ1QHU7jsPpuU3+K5whQt4D0Ka59SsK5R
JHdQyjc/Ioze6WkkUTVsZoA5z4MP0NfGBpcWruJhl8nd2FHJBbvi8Oq2i55b
TNBnKtqBHVNCnfVn8GT6sHMGAPzzHNszINaJICmu44UDM4kW7sRFtx6PUVey
VGLAU9Tywbj7s+ih98VxKFlboGtQluw/Rub+kBvij7ynj/3Lovf/kQDxq2Xu
dzLU+Ri7iemdBEG6aYOn/W9PCuxl/AXO2KVpquVDnf9WPO70WB0iHwhsZBxy
z5KUqs/NPPV5AyiVOD/ZuWdPxU8ZPBrRqpLZSbLCHk4J2/9JHViEgSkW0RNM
HrxFd5EslmQTtR+gNhMHZHa2hXBH3oTsIBEUQGt5NrhD8ZhY9gnUPtDlc9iP
VJS0+NsuYbDtifcYJsmTnHcZQBaSB9Ec8c9ul9LFQmC600OLv8/tbCdKhWvZ
k3hYpLRWuaSzG/ZsKJa1IN0xwkpyDEnWm73SayfuXZRlXa3XbvkAi0lUWUJ3
Ktvo+YVLj3S56OR7oMszlvle3/fBJVAhAuS/oQ3PrjvhxRAqZp31RgLrnGOi
vDkOlfhJXRDZ9dhwUhoN6+RCaAqGc+PhgCK4NENc6JBEa6S6qO036SnmUSCB
HRjuZHEkVjr2/dpBiofuaYf7oKIBtiHHHkdSvqdp7aRyWtwW0dFxr46q9foi
MifRcIOFxvYMO2uoJPBxrNpSummSt9AZHwwv0Zl5pg15Mr2cBS9r0ISn0yuj
hBHyP5P3KslzkHZa3bwWrP9Q4oq6geGLjcjZl+KL8H7jqL9XlNcyoMl3S4BA
x0N+oHt54L2MAi9jt4OODMIM8/zpeEZJ4JpVWe4TFCv8YjNRIjG6+si0IPcE
+3fN/ML7CQbSs8h3QUyJ2/fws9JxymcQESwwZMSRhxCXjVXcRwFmmTEIfBwQ
wBIe9Ck7O5+N4pddVFL9YD7NGsL5cVYFXbpFrsDtp+gYW9ITzOoFNqPMSxCh
ZNcnFhTnSgfGyHxzUHFxgcXu+YawWrwDTHaTJDH0U4siwSrV8EoQL1B586Za
10zwaj8dZd9pH1jLJr89IoNzKcNZsLuP/fmo+Yk9gAa6BN1hkViu5xx7m2uq
mnjupAmVtOIK1T+RH4Pb7UTJBG5F09CvJOoB0FHGP9zlgCt5QTeEeznvwoeI
XeCLuavglE/4j9qMSRpGN/uQSqEaGwWLzirvzotSM/Mkw0KaWrULkJnUYI+M
X8EtHwOJNorntHuqjtrVzNRJ8sY98jBm2AHzrP9c19lDiZE7boFITdj4k8uV
QHTyGpPA98IHvjcZmZxsucnIfLTJyHyeGpmaVGlRZTdBoBduDAAhM5sA8Y9s
pj76nJn6/Nc0U9UNRd2d49v053+oF0WgnRv+/FYF5iEbOTbfUwC9HKLe7SHW
zw7Qcejrhk3JQbHaxBWIGbrt8zQb6cjJlkefPm0a7qCf98SXhKnWRtJubspZ
kPkse/l8QN9Qd6K+jxbbj+OW2eP17P4Tr0cyuyBPcM7SvyqFmV9pX+fDC7zH
fYXeHb8+8k1pjaldl+XA4GKvCp0dhzEzyTqb5/W8Xfmi59RHyEImPOplmdej
FI8kyUzxWOP4MbYFkoTpjk6etgOmx8aSbyqVSmN2sG7o4jvQudfZhywcKCvv
fSOuWG5N4OSTfzjpoBnHrl3SHAc2KSyVl+LX9CLYlTSm6dSDujfD5cPden75
QxDzX3QsGJw6ev2Xsx/evjsO9jwbmaL8E0ZsiErrfhGFy17mAr/C9YS8lewi
AtOM9pIpd+tnO1An2HQbRFOGXAr3AEevAeEJ8Bl80Rnn5WVVXIrGnTb0dqZf
KAPhxO2qdrV5O+MvhJIMjNZvDciVky+8ZicX5bu4lGDiB6KKU96QP2Xff9YQ
JyAuINkQhG8cR25tyHNmQN0u0NZrPr5QURv04DpySqROdEjxs3rUZBMNOyL4
KGPAj1vhOeaa8pGXwBDhMUJNnlk4xUAdmY96A8F6lw7X7/ZLlgKIpJd+T1vH
+DUsfYCMfwHlulohmE86Pzs5E7CykzzHMOuMF9c5Od6cZp6Q7Yttsl0G8t27
MvGwheUX9atZWAaJ83Ymlp/8VzKxzijDqWmlsJBLfQYwmZFrQYW2OCqlTHdB
7Tn1J3dmPqVHvXXNSrwscNY65iXh62XibEZf7kpB/bGkPrtspoGs8bug8i71
/Bpt0NQUXrTlnMsxKe877k+eEnUI1OHUI+RWG2OOoV0/hR9D6ttOrIz4qVz0
zkX7OlHJTnCPdLYChsSO22/2ooQe73JI5hwPtcd8+Nz1f8V2z6F4PnQ+H6zC
Hw+W4Y9c9/cO+7jMrVtVVHc6FXucaL2tSdfrFLBSoP7SFMBcOUMV6x+xGBM9
wTxg1jp/HpaANKHVwgyQAj1Vrtg7gUVSGUPaUcjPwpxDPPfEly1aGDVuXNct
JW36pB/MLo4g6rA6SdeCxWu7savBMDyZYbMMJn9Y3kheGKZhDPLqpNWzC1/P
yK3VgIgU+MfpK52SIDklcav1AZf45xBLPO0n9zlyO9g92u0kJ4Gyhr9ydS1e
Rvmz0lShCaJ9XdW6ppyYap5QeT//k7RYdLb7puE3v7rkGIzflaH82iXwrvWU
lydZ/MCqXHnChZSkRovA3H5dUu9mksOVK34mNw8iJSegudxj30s4dBv9KB2u
PrJZ/hFEoLsbbMzfvWRD8ePL+B/+jM8+eoGm7K1a6VL/3B31cdsxrh2cQKDd
3S23JZUkQA9P1/b8dvNR1uYoTlr+0oM4IwcpT34vBXxV5HOqxKGuKfhCNEB9
/nxKOZq+cIjlEnbEXbJ3LooYo+QBTurmkAAIZWWYpLjVJ8eL1vgyPbp9EmZE
tukJIkywwdUeV84VsPv+qU7639Ir0YGzc+qj4qAuLBG/xUdKLyDs+So+igfr
owg2uXCbBx/Kg0dHb4/8BX4fIb4nLrxXzL9cjLLWJvcfwEP9d8nxoI9kUFZJ
vmA1j+XBgzcHZ/5C9/WImHAD3K+ZxG8fmtx/4oalkZ4+eXz/vprgvy9ewJU1
2AiI85j6+FH11yIPPZGHnjx6HB8DOyJgjzm/puSzwzx68uWn+OGluhujK3NT
V0DZ56juiksB6dwQG6ThZqrDdGrQ5grJ5H1bURA8klT34lfdRBXjGLFxLRKw
7ZNLOtvw0p70QWKwPtU8NAcXFiOqTzA7RlS0CmxpFKh5cJYQ+IFTFIU8irH1
DIIZd7WOezQlS9oRvYei8c31WtK+OVc9yk6NfWfUfp7YMJlR9LwUEhJwFrXm
/gHYMMQNECm7IYM1NAOhdz5R0EA66sUK/sz3Y0OJ1bOoJeWB345F2QapBeQb
Ihl9gUeKQPf1K7lO+pi75oirqkFCo+BWVBvOyJjbVB0L0YY40OC0uN56o8h3
G0zGUBtNVjmJ5bgIp2+vYs6Tf+VJ5HeyEn9hJbg//RTUENXkKzK5roCaqPCH
ToZTAvuvUJT8VFythFeoDgoz6X8i8wYs8orKXaIURwSeAwJZVFfoNWvMsqrl
pVnGFYz1FxnebMNb5nHnrnZRX4KhxskXfUUQzXduKZbhWzvo9ToUYOY6Ieq/
5MsKb9MTiKBZJu3HQhk8Y20WsjmJLGu3VVLwhg7hYNPeyKyM9tenG0T0tU9l
9T3OfAmWK2gnXjKAf77xPK43r2NEQy3e4WLD1d3IBRUnbXONMwPtM50CxpH7
kJ2meFChBaVD2AxwqfKWekjS7nTyGccUQi8Ui2r7h96u5l+RgQYcdnpAd4tw
EmFjt3nH2jjll2N5u5ZUD97Y2g1wuNvHCACKrhBYBm5xCCu2z+R1cUzJmDZg
uX+RJAKi+1OYhCt3jAp5+J2qI7UGKQQ8r6zKbtD4sy9kxTQedZqvAP9qfAHT
AODqxAEWZpfsphvo+pYwp3ROzA9rUHolLfC658H5CWlLqFQG9ntCVWOSCMgD
bT9CzMHyAqWFCCHEc/9aQnKYwkEd+aYgbrUdFqHx9Ta1VKOIl6r7ir+07KMD
Be1cnmugiDBNIqZDGoy4EzS9TMgVckflL2sKh8VpNztKPHLpKeLO7eatd8Pf
vuLTy6P4VSH8csKKGkekbbBYtdvYGse6UiInyZ2Y5Mbwcctf0NvdCmmutjYs
PmQE9xYUMvpLg64TtNO9KGhsp1mI95Ju0EXZPEktSS5cwrwX10SmlPuwTIba
juj5BUXnaFfUDCuq7MVuNcDzp2CmFeZLxkAnKrnGUpeiKANYSdk2YF38JK5b
l3woXWhQCrjrkQ+z0/QmzOze1xIqeJTJaUDfBnjbpV6WagSo6Nx29PxoR9ZO
5Z4haQmL1akCLnLfDfj8UPZJiEOdBVHLo/daR8Kxo6JBicW+ppqjYlJZzeQl
3DZsSWqb0EGdLt81uy19lga9h8dwlh0pXpz0FXs4/erwHTj+DUCr/CfRE1t6
sx9RK7rGf88vw0M5nbUzqrjrnQLT2bJyYV8QjC0eDCpgXOJUubfZkaO90Nis
ky+spHF0pleaEoR5VBLB/P7dGXxlq21X7aG8+V685qHtXPCs7NFSDtFDR9zn
DTVXO5bmamCy+agZv/BRiFlz7q+8+Ej0laZaV0W1vB6z5rKoWidy7JjRuzYD
wf7+i2Mo5eF3aeaDfMXMio9skCfpFfL1I13eVX+AW/+kXuG/f1J78nVfLt/4
9GfmxsyNv8hT8PGv4eO/KXy9eCfVYledSQ+XYwHSmQDpXtIzeZeIez9uljOF
5VOLddemJ7mWdsghq3V3sF2dtLQlLDnnwmpSCl4FUWfpZUeVkv48e96XS7qi
CwLSHLElyg/tj2HZ/CZX8l9xdBQ93Bm+MKovz6llHN4f51q6JnPDDXoIuT1z
w5IJK3DjrOvSh2TpvSXedKO5XvGu3I9sLuxLw5Z+uxZpyNaSyHvDSxmn8+1y
WHag1cuhSxtLf65KX7fi9fpXDtj0LsjWCrjFcpRmiYfj2w+4L0gRx8s2VwH7
NwjS8YXk3LKiDDzkRKYx88Y77PcovxceLvwro+I3ZlHW8ZrlrO/qmepDWWhH
OgdU4b6D7lhwO3GPyt177mWiTaJOcwW5zynw4e/Bzjs5vy8CRFaNVMLvdEXO
TnfhA2OHrtTrUgxwTCTIVNSkgk0dzLqPOz6R5ZokGnBvyKGum/Tev/j9udwy
upUFRS4sl4VBdFrVUr4UXjxJodQJAEAKMTptuZJ3nMeV+lHqqAGOTh7rsSuu
oPPgdqJS8huB3tFjcgTSYKNL6C68yv0FudOk70ZkW4nZCoT5GHeZGzCDSnpl
Rnnp9Errq3IoRYOcSi6fbKz+MlWvpWRlTzKsogfymMosYtk4HYCbJklIzlV2
AL3s/yKeBSJ47us+2L75cLf70ycSGKyTmOyPI5K4I+8e1S1MUW+gKtIPLtQJ
rPNavWotkPO3/K4jfOfk93Asb2G53BT+a7NYwFcNWz5tLRwsXEIr9xsDppU6
06BlgHWM2SK46z9fY+cv0KZq7RTnvKaQqrniRNlqRcvf/IL6miJ57Fi5qhRQ
QJGT3c7xbDsWe9b71L133/vUr/0LY29T7Hqr4byrN4256M6pkFLi9AOK1iex
dlSgJqRAhaB70gcrDtznNgzlGxm6CCdiaNTKI4xh03Lcf5f4/H9MuytzGIIl
lMxhESe+rs5LdcoQ86aPeBOYTfMyw1igv2F+DYD7NXA9dQLMjH2mbGJPMrOm
V/USCgzW9t9iVblR+xUV52QwwwythxNtf2ovApaFcTah22fR4ReeMqyQ/MGn
VxpE57naBRF5hUHy3SLXarcpkHhe1S1IyX0zr7UpDRIcvqMjDLP/I3pPkLLo
CPZrID8YIatzoKg3GmQmtpv+xlyDenwMDBm+nFVgsJwYbrudhaFO9GWuTmHh
5+OICMMh+lMg5soC878BVlNmcWGMAAA=

-->

</rfc>
