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

<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>
    </abstract>
  </front>
  <middle>
    <?line 76?>

<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, the 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, which depends on the ability of the next hop to support it. Hence, it is said to be "dependent on" the next hop.</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 Values.  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> 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 characteristic. 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 yield 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.</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 an 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 that 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, but 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>
        <t>In cases where a BGP speaker receives a route for some prefix P with next hop N that carries an NHC, and receives a different route for P, N that carries no NHC or a NHC with conflicting content, that could be indicative of a configuration error as described above. In such a case, an implementation <bcp14>MAY</bcp14> log an error to help diagnose the potential problem.</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-1">
        <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 that 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="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">draft-ietf-idr-elc-00</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">5</td>
            <td align="left">AMetric</td>
            <td align="left">draft-ietf-idr-bgp-generic-metric-01</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 the 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>
  </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="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="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>
      </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="9" month="April" year="2025"/>
            <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-03"/>
        </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="14" month="October" 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-07"/>
        </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="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 321?>

<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+Vd6XYct5X+z3P0Dhjqh8hJdx+tliXHiVokZTGmKA5Jx1lO
jg+6Ct2EWV3VKVSRoin6WeZZ5snmbkChlqYoZzwnM2FisbsWLBd3+e4CcDwe
39twlc7TH3RW5Oalqsra3Nuwq5I+uurxw4cvHj6+t5Ho6qVyVQqP17Oldc4W
eXW1gjf2907f3NvQpdEvVVkt7m1cLuBiXpkyN5Xayxc2N6a0+UKdaneu3hRl
Aj3c20iLJNdLaCAt9bwaW1PNxzYtx/lZMn74EJ+obJXB/dffHKlD86FSb4uV
2jUrk6cmr9TOmS51At1YV9nEqWlVlXZWV9S4ns1Kc/FSHb7dubeR6RyGZPJ7
G+eXL+9tKDVWs8WKP0Bv8HRdnRUl3BqrssAuTWqrosQneIivyzovoO+k1CY3
eL0oocn3JbRMX81S2+ylmuFzk1See1XQ/UlSLLFpbupbWxpTWfVtsVyZLNOh
sbdHe1FL5/zYqx/r3K5MOQFaNm2cmHJh1LelNWV4fce6pFAnV64ySxc15Mw5
PvcqwfvtoZzo6kqrd8WZhqUMDf3FJTrjhn0TS37k1U98y7cS00o1xPpDcZar
bybqJKnTNBphe4I/LtwrWIVJXke0MRc2V98D0dZRZX4JN4eJ8hpfxUX2BCmW
iXZV9DY88QM88SrhOzyNBPiY+AYYQDWtfW+X6i1yWmmT8w+h0cPi3OqoyUu7
nJyFx17leLtN5D/Av059V1W6LEIz+/BG4ONmADF5anrjlTXGTOAdZOq8KJe6
sheGmPj4zc7jR49ehM/Pnj7zn58+fv4ofH7+xUP/+YvHX34RPj9/8cR/hkfC
9S8fPX/6UgElbD5v9bc/3p2cae1ISGHlxtoL3NgAX6yapxpRBqkdnxWrMdzW
M5vZ6io85Jg7qCUgQ1msrsaZnpksPMEUCN0VOm3m1Mzj2cMvwryfPX3xOMzp
+cNw/csXz/gzLMt4rPTMVag6kKZwV+FrSmdZcemUJnXjVkafm1JVhdLphSkr
64yylVNhIhYWFe7itRWot4n6HtgA3i4LIIiycBVmpBe6MqmamasiT1V1BjeW
S5AXuEpvjeB9fLZ2Zl5n1BuOQiXQowZ2TjoqDh6YGQUce2GuoN15XUKb0Dfw
k1ppGGVSZ3qo1TAHWNJLXaaojVegFuGC0VVdGjdBYpyewWsw98TOLSh8UPEq
NXPQ354uQLbcWWQJFVYfO0h0WV4pVydnKrBNkY9oypufo7tHmyAgqLUn6rs8
s+eGmmhRnUcEVL1SfvG4oy61Ap2AkngfWlV6tcpgoKC44BcMHK/TkrmGSNQ0
3sAZf3e0Oz3dg6+6wgZxWRzdbOhNw0XyIW8tbZpmZILuoxEsi7ROiJDX9y1+
vcFb19fCrDc3Ed8VJciD+gaY41JfqaOyqIqkyNQWDGP7/wFHLmFS8OyvwJXF
Ci/q7Ndnz81RYE8c2YnNExN4C0YJS4xNpEAna+bAYtCZUAcnF3UOSgjWZf3M
iWQAnFJP49IsAFKUtHyXsLLmArlBuJTW+IFTqHAVKFwcCywVgI8U7DCOEgZ+
ib0IzyMvIPGBhsV8rWg7JBE2pfMHFQ5iUQNhYI4whi2d03RLzz40hpIlJS2M
w1fscpWZJZK06i/iZVFnyIrKfIDrOC8YXGDSRmRhiCv999qoVFd6exRumDwp
UsPSGCYOs0EJKEoLuFODTaUVC2Iu41sWrgKKJjAyWKR6lRJZ8akw94nan4eu
Vto56gkaWZx5oZLGmNCdcVxagJR11SwbEZ+boylcwSNZpuZg7XHewBXAnbiw
KtPYtPmgl6jnRkqLpMJ47coiMWE9FPAn/JcUxDzZ1USxmCRnQG+vVHDorl6t
irISLrKikkgrogzCiKvLojyHr0lJSwXvQmv7zKrwmQlOnE2qAec8InWHFAqk
gDt5IcTwc/XUIGbGQRezzF7YonZA9f5K/wj+hiKlr/MrVaAmuV22JwODWDOA
CikLozjTXqD0LCPlcFGgXkBBRZG66qg40od5ktXIaY0hIcUECBPYGyaQGlCO
GaijkiTrwqZsda6vq1mZ3NzQ09OcJom6yPJtrRYwnTy2M4AVnV54jepaGoOY
rTTIHk40M/hFvHoH+gqmf2w0jJ6Bll9BenXr8OB4fzs2cVbai8wYD4H5rci9
fSxAP+PbEzVVqZ3PTYl80BmuF7fGdjqAvWBna3D2wCYuziriDqEkdMFygF3Z
OTwnUg39xASiEUpXrC2wEVw7GEcS9UYa+fUV6RtRLyNsODDGpXVnTLXaMbPB
R1jSBBjJMCWxb1jsMJWOCm4PneRbIbn9+OBZB7rfsWWIxUf3WIqbavEAiepZ
PEfUH0g30Gja9Rsp5h0On6G20SQ06x5ewe0RKBkLw2YHBDQl87Tnmk6zOHOv
QWw1QZcIbQmDBKdtKsK02fgzRb7ZaoIJcv8+cOffa8s6xgHD5mBMFoYNvFHn
qBBBmTm1+e67k1MwtPRbHb6nz8d7//Hd/vHeLn4+eTs9OAgfNuSJk7fvvzvY
bT41b+68f/du73CXX4arqnVpY/Pd9M+bzIqb749O998fTg82mftgjmmR1GTA
ULaDDjXlqjTIf9pteC6i5Xy9c/Rf//noKUj+v4l/BhCPv6BjBV9QxUcyxl/R
HmwANjUghsgUwI+A6yzoYuBCWH3gjMtcwdKaycbGv/8VKfO3l+q3s2T16Onv
5AJOuHXR06x1kWjWv9J7mYk4cGmgm0DN1vUOpdvjnf659d3TPbr4299nYP7U
+NGXv//dBuPpzw0EAeYm/Sv8t4d4weYLz3J3bK5BklsER4KrgsCCTBZc3kZ5
QAMn5moU2yvsCEUvaorUB8bPFGIY9eQF2m/BOxnAf9cYncZEZ6TkdZoCPoQH
cLR2ftW1dV6EGfcHFAVQYbnSOSC+pitnFzBW8AwKNO4W1ZXH57HhYZuTeux4
C2Z1hagGGLgtvYVdgueC1yOSwFWTu5rtJcEAwsRJWcDMIg/cqS0zWUxGMpsS
QDUo/qJ02x5oNqjDtMmAIkZCi2IDYzZigXpzgJVhkoRXEWgS1AmjBJwF8KvK
ifBzmQwYU0SFreHGo6oxLkTR1cZIEUqD/4unhNg30+zPGsBsE8+cDRPv4mDm
1oBlKBpE2rASNMZIOGU7cWY0+pGosgNqEF6xglJb6LU0tLjAzHdAxSOgHGJL
Nr1Fbvg9oNApMPP4wOSL6mz8R50BXN86PfgjLFNpASS5lzixn3/+WWntLii8
p9RD1f95NHDt8cC1J76JR3D7iXqqnqkv1HP1pXrxOdeokd+M/8H/USsf4b+p
iOYbgO5AwX1P9VLuK3UyfbPPE/jY6B6gGnyXsdz+073f+x7G8o/88Fh+bl3z
SNPPEXgxTGDrQpcWpX07fuPn/8GxfIoun/r59eiCP22ToYDv3Rqa4M8/GV1A
KO9tXL9UlG35+gEqlzek+h+o+/lZwmbgxuulpQEbki+c10WibUg/waTXSsCI
WR+0xUk9c4AE0dTe8jRrkpjLGDTdwobbpO5BBzKiBk1/Yjj29gQfo6AbRsPF
H9sH3ViXAL4IxXeWEK05ruO/hNpSPQ7eQVDCbDZ4X1bnzmz4yfu/pnh2xi7G
6f+oePZVjZdWEtGBdXwJnAwyMy7gMmISBH0c/jELDwJsnqLbLPCAcClITMeJ
jKIHKIl1rpczu6g5mhMhDAoMpvbCprXOOo1MBgbJzPT5w8zovREKOr0E+FOU
0uCKk4qagJGWF/Hhh60mdfWJt1Et/GTKYhy6npjJyIeVAKjX4Lhd4PND86SG
cJqe9aSZMLL9yseQg3vpA3wee1Pja6aJi83O9rSVxPLOYQhhEF6D6eYE4GyO
EDWhVnuBA/ZTfDxnoMPRsGpgZT1EAJjnYYFAElxaDLiNJA5VFgnoc5zqss4q
xIxhZKTlKXrfGx8Gmglrlxxc4BAzsB3MLgUHckHuM7hMVsKITZt910Fsmyev
zvOizhOK5sedfgV3a/TL+1SeoT9jVmCHyFuC5TOriofenxXxSMt5ALf4lyzS
lnaN/IWY2MBibfN6NmG8oQUC/xCTT341mBium16LCBkF9j2bDpkTZAhPpFbM
BF8IYRYfoG682ss7qBBCXGEFMp20s3425/C25hlRng3mNSg/W/v8HvBmTsG3
YXb8fElBRkytS2pHGnRWXIAQ5EXwBB06bGF4tkl0UtgHzNQ045Ag86r+sRh4
ZwlURq9tRFrYZ1/Yux7i0KQA/3bZz51iEApj8NjuiILjZTGrHTvASEh4byJx
lROTp1F2Q13fd3yFLNIJRg+BfdrSciIak936Y1ShTYi2SQwSUYNbftjKbxKG
m0NLtkn34DCOObMBvZFmjmVKYredMIytRAdx5Nl1V5aYi/36EDBGhq+IEY4n
MAQirTNVOwKRmpWlKLWwYsczj7x5DiyCCtOUDDocqdp5khoJWwmsJcZpJo9k
RJcd7qUw9XlZLIErYEU5fRLRfITmFToHsQ75YvMBpjhRb2zpgAgnwA6SkgtR
GSKoT2aF3MohJog80ZzBV4Mmxog56QEtiRyvkjWB8a9wUSSU6JBDhzJBoHY5
ewmfMmS5kDnEEBUw7RyAB7IwzRI4B9N1eWqQ8S9h7uBhlBfGm3SOuICoNYqP
6ESKx8w1CLgMrlv+Af86ZhJgnToHQheL3P6EHd+acx6PJQ5WSXSlncQkXdik
42k1wVcp8rS1CIHcyNK8qpf6SrImvfx6/7VDymEyj3h6HrJQeEhwC+kniEdk
oYIAoT7OrsaoNqqyJuYekKjjkYqf0C5S+MS/XiI2hwV3k7hqoqbAPcz1fZEM
eSIxd58aGCehMPsThzYDHwQZar+FljVf1ZXXPKF9yjCxMAFHYogeGAG7kMii
XGQGT4pVCNPC0Dna6JOGoAYACg1WsAiV0AbSsCgQGdHV453I8pLRsF6/kGvb
MZ9E1SEVF0gAFD1h2cEeqIShMzCUc0kL+ecpmy2pqzjBdZe1OWmi3cw/PmHa
sWDCjQM1AigRvDwVR1O7I4YxiqgjAdY3jLnboGD4JlUIFhnS8/LMcIJtHWO2
ymyGekJz5LtB816OF6WM2HeTt2LiM41wAVVTqMoI6Typq3WGynFHbYRB+WfQ
KnVpq6sfgEoS99itjWeWnOL2vgJkSKW10xYIemHmLRXpyz04un5rvQdySG/t
RiJ+UW6QpoevS/gGWka2oEg6zBcMLvsCfgyB9Thk3bQsLgYjRqlgojwvK4Dg
A8TqzWcPKszCjQh8YykGAsCZ8UL8BmuiTlqzo3YpxoTVhkDrkGUJyhYkwyFt
iMfJKaDEOsOo++rA5ufjgwJs3Pg9pgZ9XMsBosqy/OxGolZkCFBBulEoAPKk
EOQVkBVrPc4PcMJRqwz7ybCfkEtC+QH7uMiKWXOVbLx3u8jKa1w+cFyXoBgs
pj5mJtGoUinHIkaWq3m0V0HSZp1bjPlJyI5bzX1PTY3LpjMAYVGSqCBms8vP
rKMQW96Iwbsix1yruc5gIKCRiXFZ9LKsRrVMQ2HJjEoz6AV4XsTitABiVVZY
k5/GqUodQUzkpkQg0PmS6iQC96DFbeiJhroxuw2zQZv7u2TLtq6vZ4uVTW9u
tgM7TBeL0ogSuMZIrG4uECtwfZ+/CIvOhYwjyeejmS1rQE++CE0MF3GHNyne
J/BZHW+aEutk/bzKi0ogvNYNLo8fhE864mpeUsCmot6XLKLk+HHVgeXgK+q1
WKd2tTbaH5MBtSWTGNuWdb1jIGUuHKkp69c00Wm/qSWLZdT3EHJxbTWG1Lwt
xAUOo6vEeRPLzkViHTshVUh+8CmBNRgsrxmO3DuA1OOgvRkNNh5PJm4f57N1
zCsUMZd1bX+cA+WPnz9CJRacTvAa5/ZD60VAuUmxnFkKmqBz4XOB+M84IBN+
k107YgbUqYjqu48QbHZ0G+t0PcHR2256JYAPSlvQvc7Z0YH3qHguHoYU9s6l
AJAccz8NhE4mC2WHXJjKpGaHHw1fkyWebIciFlFAkbvbKKVh2BLu+xF5jwJf
b6oqSNdBd+2MK87mnwjaYFjonxXZSMFzrKoF0/pKYV8ToaOivoAWvIKmQgku
HAgGMqSUbvfjCYd6q+NH2iTRbgLw6tRqhLGFqlPkYzKBjY6SAmofL4oWI3pH
EI28imXXRucSviDg0KrZ7SE5CptK0l8Kx3OPB9WswOChx3q+LMzP23uYa2tR
JGZA9cSIJsjjKaiu1MVETDDwWnmRbLBBbK9EVMQMUCV1mywU+jUfKP4aIvuh
N+RVaCUrFguvGPdJGpxNmfOC2Ytns0lkNQ7LxVQbqVAUlAr2sPDeIlq01RjW
fQy/ObKD5XWUVwRuv8CACDA8RxixARowWy1Z6FBzj1APByQ8icuspZyl1wnX
AYLAgr3l4W6SsHoM6/UkaJ93Rz8c70133jZ5fF9RTQutAxzEQpoYNe4fXXzR
AolRIIgSM32AyTiUytiXBfqYaU1k5n2C8CBy4tY+bXWIdATPxk+aS0B5brzr
gJaLNbisArHRFdiI0sfTpMAxwmLgQBgzkBzGLVRo82BGbFQEZK/HzWFaYFYQ
2jf1PR1tRfj95iuK48SI2nNtHJOwzrtDXBEP4mqrwCRruxAAOekngBr7owcD
06wPg0QjrD/TpDSbIHQ3Ts9xBjGDg4F09csG0dMvDJoXueRDekkL6a2z4STE
dFZcQdsJ3w2NIIZNXg9qSmeasizKAAd5rdfkYiJzDmua1fQga1LGG2QxSrmE
aAQDklhTK5HOqs5zk9FuEceYBHigpECOtxStqvYGxnCT6HrMDG4jMLok9Igh
rr0PsZwxrQX+xntGqCC5iZJO66rIi2VRO9lYuk1Fj7OrDozYcsa7EDDwbVoN
DsZaSWkq3gWRIWjgoJkRWJvT4hfqPPdQGatfg0Esg2noDUZtTU+22bOIKu3W
AWUpNW8m55tHA0LpDjU9Yb0hVeIxJZqFkmHT26O4jjAr0FVnpxQ4BIPKn7+k
E/XGk5FNJedayDhYSUumS5A8QhhF2dRryy4Ox0uTcgxGqNmZKlFTInYh28y4
K2LtfkDSKwEC0hSJJl3rp5zpD37MMDrLrN7lFZ80auob91C41FvJ10Y7JXgu
XsUvdYYq0qSeDk0Wv1Oh6Ksh/UxDTwdRuj1GXkeI9ZvHBN5teQPxdBLVD5Fb
BGJAXE3Dc1WI6TTDCly7DrZTyDUyNVT7LgJdL/3bDpSVU1vD1TcrwJnq6fad
ehrx0326IaH9hFtQFeZIjmycl8IXwHqXyFNdskZ2p7M5hL2daAHZ7cGq80jT
Ngkv8P3KAoUDhrjZ+EEC+TZjk0RrgruXxe59l6MayYfUu2vp9zZ2mJm2lhcG
bG/6BNd8KGouUHKIU0HpeO+Z9aDkpdIGkaLAiedNRteySA9NmwKiDDkpCzaU
z9Jk7LAdoCU8wKnLwoNiiu6EQB2rlvamO333mcuCB0TALgZ79FK2zjGmzmLI
LhfvKvoYAKqNhajSS+kenq94b66sjvjyuhpo2OdEeyYZA2yUGg/LMhQ0wafE
eGMMiPAGFzoJZAWr9p5R4QAXNG8GtwyxQ+1Acia8RW1tIkvAnouWkyY79jUs
nEX0RM771RPARbSrjsLLqL9p71I3/r6O8F4l+9LK9ysjdn1HmJq+OV80SboG
oAXjY3FMQpVETrImQWE2FftHTaCZdJAtOziGMXEIjFzh8QzSkh6MTj3/EkR+
sAQHBbwpIFhDdjHMmvIG2IuD+8HmdgcdtlCe2W5xgN84wJQriHIowqtmyycV
P7SmxCZyhcT1OIi2GfDzFNRqvdFg4nhinSn1UnJrJucbDv4bzYCjBARtaKNI
Zt1Z80pp4h3jLilWJiRpvPz7mtrYW10bi2GoOqcKliYod9Sv94jLMuJNg1Fb
HURHrR6Nui+DDkOVQdgtxK4RmWSWY+ISG/DKwSfTpT4Qc2EM91vAl5VSP789
kDoZjJdlxaLRbaCIz0y2gglp0D4iQGFrjs9HTJq9UNH+go6Ovb7P3iCp6DXO
KEeHggPrUTkzoNAykCHa4Clxom6Cg4qsKhch2dMi6Joo+2NbMSDZSFjPQRHR
1mYs/3GuSKxP5HUmiosP2PWwXs5M2QovPSD1l+LpA6f99zoE2qLcy7YfIPIR
HrrAFVEX5orH2PLK58Er9wpzYEPZ/q6vtoh74z1eo+5lQWJfMksHNndER670
XEeBni/UEIQUPxHiX6N4fciV/xq6lfvD2PlrGM3/UvF6Z/l+9YLx28aiItm5
5efXKl5vEp5xzXqbQC+HpDfyxR53fDEWHrqAxxuB47JOK5Ay9NPnbtbKEbf3
/MWTm5t1ze33I7N8S5RqaSQoeFtARfojkB5FGwztfCRgwHHbEY8IDzvCKbPf
8/zhM/LTqlAYTsEFy34eptFIV1/qUEnEA3zAexbfH+0dhvNAjKEccYKntqVD
lZ20duxjpRIXT2wJtj/UU7dRmjcy4d0Quw/5VcVNSaw1bqz1GjtYraxsJz/e
PouFXhtJWkyKoUYMutYcoTJwbIov0WPrQODgQ8Wr5HjfgzdQ4eXWwQWxZ+3j
+ux2EWi2uWzDDzbYl022c7aDWUemy/X9Mrn4obHzn7kuAIP2/nT6w9v3R03h
F3mRHjITS6zxmXW/UMNnWbmGkONedzVeJGGa+V4C+Xd+t0N1ok33dB4K4Lfp
3tAxQCBcAV6Dz1pjm18U2YUkEtunKXFgNC414QRzUfryv+3RZ1JJGkZIDk5h
itvmMGMFq/cVR+N85pIUgiT+KKoZVjkc/WFIFZAakFgN8Rt7ubVr0rFMqLu5
Ab2Tn8IpHCyCMoiAInULREqZZWBNzv3VrnGBGva4E5tj/ohXPAeFCK8RZ3LH
oigGStWCSw7yGooUuES4D+0bCuERN5yc5FhGpK0OYegDUvwLBNeXI0F/cuaO
tzMNU3Yi+0yzTntxKZVXze2wGCaB6IAinyO9f1867sdsG/y7LmyLS+kjihGF
eDu982AYo2SSeEXHCGXTB3bW74ip4s5bp6uIy9hs3YgYeI5V73FGubVopxR+
rWqpXRR/dg0jz6mSl/KUxlU9Sgc9feOXLIQb1Vu/DSpYAr8lDWOmeGhn7HCG
gloKOIwkN+sjrQNp7ftqf3o47URywHbgVS4oxNsoD0tNRWmgaVZFqUsKIBRJ
q9t+sJyMKiYjwskxtx9jdwRgfGkoGbEAWoKXSP1LyhNo55O551KFFw0CE6E6
p7NYcnpKyj3J68SQDQcGfJ4mHJvSHKzwUTbzfWQv4SNIpH8aIO9vXjJu/fgy
/sWf8d0nLxBZ3+nUEDoqZFt93PK6cRs7EGJ3J8snMEjANJATg7xwf/Nu/VGE
ezNO8HzuOpxSwpQ7f9Cme5HZhEoXaJ8IHqwKWo8/n1A8O1RasJjg4R8LDhaE
/RksCaCpfB+UaGfvn+1uyKCERKLYsJftpdsl4aJa5fYKIk1wK98OlxtlMPv+
qo7739p3ogVnX/kjBus4bI/f4iWls497rtNHcag/qr2DnYsn/kbnmGOT4THH
69t4LG0cHr49VO028Azc5nzVcMgqBfvGDx/BS/1zcrnRJ9IoK0tp9C4zeiov
7r/ZPw03uic34ymtYCmrcXwm5fjhM98stfRM3p2+M5gkXN8SYXWbjJf0HM+r
aeaLZ0+BemP8/eIF3FkBBkIpwsDzR9Wfkrz0TF569uRpvLDsaQGpLJ+A98lm
njz7fL4AP/h+LACsnn0dW19F+zv+/KLOAzHgbh6mcjhvv9YXqrWOMm0O+4oT
qQ/iUxSjslusHvJl5rh1zmdk1pwH2X6RVHZI9DUnK4nSyuCS5BXkdE6qHQRF
t9noh8FeBOlahLWlIA7OYJvk3PURz4yPBIr3ubWGtC11NpQkr65WknTjTGGU
G4iDA3R2Fyl2won0vtRyEXHmpeYabNx04RuIs/chf9BsqKADRSkqKruRYwQz
C1tZ0Qb2PAYpeuCjV3E/awfihU1lRp/jkjrTFA9Y3ToDyu8rXxYVyhmV8UQl
usyL1rWPJWqiqXEgdQaTxfqU3nBlCdHNqBtI3FSohnxSqwKij8dxL2k4SC9y
q53Elxlf9rufAKxhDGeXBCsvQaCo8oIW5/p6+FBqBnU0YgkhUyEKpjJ/IgwH
XkdB9QYp2up8UUtuxRPCl7ch5lsUpZzJanzFTn+gzbmJPG1uN/HFY/oC0Cie
LzCUdUAXhXdmphfgv9PhjXSeFRdq0C62UNd1l61VRNG8tYuzKUhmxk2bbXYk
maWfKoHGoYXYXzc3ws7R/Pqig7zO1TrCf7xVNNTA+NJiUicDPBgO7pJEZcRs
mATy/FhxnS0qQsVZM640NT7NdBvNRlGEhONCuFDNDn7PtCnwUhG8EVRYi4Iz
+60NUaNYSui42qjKeujs3nDEIPr4WHSPLqUoE9FkdznBd9RWmSM5u1XKt27d
IQs83N0OBgRFdw+GgVMc4oqtUzmMmKUZq1gdbwNjB50iPKIofL1ZVEnBp9Rv
qhUYIlB7OZ4j3U6MffKIewCt2+rELoH/Sjzac4BwZcvJb3rn2Fp+i1zfkea0
VR5I5yo0YK2dxN31IMvU2VnXNoP9rXXFiIwC6kDXz4JxQjBDgyF2CPk8HHtN
MSFYqMOwP8OPtqMiYOHmupRyAPHEuwdIt/PuHSpoH9ZZgUQ03bQsdVMknvKe
R6w2zMe+kjaqP1hRyD8iDCyzRB3aq4gzd+un3k3xhZK7YJPioxb56OuCSvjb
uwkZ3a3dYuR8LYc35t5U8sFa8Ykp4AH4EVJfoArZfEgL/hRJ2veRGyxdQd8/
mILKdbZtMBIAF0nNdHLOGHaqdlD0vpcgSbORsfFcd6i3AwCkvBBvaLvekWzX
AwAbYqR8srLMS/MWajlDU1R3VYBLWiyuRqzE50Xtpc+NOFRRmoHcTv8MQspw
/aad6JKvmEj7yL5JK5smXz/S7an6LTz6O/Uaf/9O7cjXXbl969uf6BsTdX+S
t+Djn5uPf1H4dyw6mbWpOpVNBUf+j+0IkR60TuGY0trvxps3JjB8OqzH7x1p
3Wtv2SAMPx3cAClbmkBUNGDuVOJuc2g8SL2jczMLJTUcOxLAkS04PuRLfcS4
nF/aHcGw+ch0ig9I4VORmBTPHu2rNtqEiM/H26p86cfwjhEytSEghwXJTujG
pXV5CMDTEXgByVJfr3lW/iIjp13ZPdDfOyB7/GqS/jc8lFG7vykH4Qf2HRz4
KoH25SIPx6MEiPPaExvkq+AGIyAt228PRndvcFeYIg6Prq9IW4HeWpR6dUbL
R0qAwsp5QQUXiIpNZZIq1D7twP1UwctZOH00PnxVO1cvV6wjwz7xtmlImw3u
CbAK72T1y4LTiXc9Tx/4E7urFrLgasaQQQrJjsFtIJaPHgPjWKKU8OHp6M7S
U/jCyLMr7Z4WfwTTRqmKCqYZ9WEJa7wFiUB8K63Eu42H9nHTEdLxQfV8CEkt
A4ocep9zIzlFYzNv1QNx5HwMBMBYTma628Raf04krhqNKoUMaHSKCI58DTCt
B29Ql/KziPReHltLIMXeXUH34XQ+oIL3LksmxwKHSIheKMzLOGVtwAqqtfta
YDrrGujgMh9KyJGL7csHRupPE7VHewLnakcS6tELNpYyh1w2ajfAG3gk4e/3
uIG87P4inQUmOEG2yUy6EKh3fb976YYMRk7dm/TrTbK4myFYxH8EbY1UUd7l
XB3DOK/U69qBOL/jYzPx+PLvYVnewnD5mKE/mPkcvmqY8kntYGHhFgL+bw2g
THWqM/AM7TnmBnHW31zhVjRwiUvtQ1oWUfSFNZdcF1Usafjr/xZMSZWA7GOC
Hw0SkFlyYTgl6UYC7W/7u1RiMPjBtX+bSsrM79RcCHy1Y9q6syoESjw+wHXY
4w7VAXZIAGpMACq03d6TFZ9Rb13TVNhdi93vHewQh0Zl5U0b/piNZ1xb81eu
fHn4t0l3ZJ5D8KQu1rDIE/Tn3uRvvYWgpDhWrKZ5mE1bgN8wnQrk3sMI8DEo
Mw4hsbcxTsGVPvMsMFhneodRWaN2C6Q3dHNcAMtXwL3up/q84bKmnXXs9kl2
+IWrDCOk8NjJpQbTeaamYCIvcfPmNLNaTasMhaf9RwdR4PCwt6aZ3R/RkUTJ
oiXYLUH8oIW0tCBRbzTYTDzA5FtzBfD4CBQyfDkt8K9mGT7IJW2aOtYXFv9O
0OJsFAlhs4hhFUi5ssH8b1WJ2+Y8cgAA

-->

</rfc>
