<?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.18 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-sidrops-bicone-sav-03" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.22.0 -->
  <front>
    <title abbrev="Bicone SAV">Bicone Source Address Validation</title>
    <seriesInfo name="Internet-Draft" value="draft-li-sidrops-bicone-sav-03"/>
    <author initials="D." surname="Li" fullname="Dan Li">
      <organization>Tsinghua University</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>tolidan@tsinghua.edu.cn</email>
      </address>
    </author>
    <author initials="L." surname="Qin" fullname="Lancheng Qin">
      <organization>Zhongguancun Laboratory</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>qinlc@mail.zgclab.edu.cn</email>
      </address>
    </author>
    <author initials="L." surname="Chen" fullname="Li Chen">
      <organization>Zhongguancun Laboratory</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>lichen@zgclab.edu.cn</email>
      </address>
    </author>
    <author initials="L." surname="Liu" fullname="Libin Liu">
      <organization>Zhongguancun Laboratory</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>liulb@zgclab.edu.cn</email>
      </address>
    </author>
    <date year="2024" month="July" day="28"/>
    <area>Operations and Management</area>
    <workgroup>SIDROPS</workgroup>
    <keyword>SAV</keyword>
    <abstract>
      <?line 61?>

<t>The primary design goal of source address validation (SAV) is avoiding improper block (i.e., blocking legitimate traffic) while maintaining directionality, especially in partial deployment scenarios (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>). Existing advanced SAV solutions (<xref target="RFC8704"/> and <xref target="I-D.ietf-sidrops-bar-sav"/>) typically generate ingress SAV allowlist filters on interfaces facing a customer or lateral peer AS. This document analyzes potential improper block problems when using the allowlist. To enhance the SAV robustness and avoid improper block, this document provides an additional option for network operators, i.e., generating a blocklist filter by using BGP updates, ROAs, and ASPAs related to the provider cone. Network operators can flexibly use the allowlist or blocklist on different interfaces according to their requirements and actual conditions.</t>
    </abstract>
  </front>
  <middle>
    <?line 66?>

<section anchor="sec-intro">
      <name>Introduction</name>
      <t>Source address spoofing is one of the most serious security threats to today's Internet. It serves as a main attack vector for large-scale Distributed Denial of Service (DDoS) attacks and is commonly used in reflective DDoS attacks. To mitigate source address spoofing, many source address validation (SAV) solutions (e.g., BCP38 <xref target="RFC2827"/> and BCP84 <xref target="RFC3704"/> <xref target="RFC8704"/>) have been proposed. The primary design goal of SAV solutions is avoiding improper block (i.e., blocking legitimate traffic) while maintaining directionality, especially in partial deployment scenarios (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>). However, previous SAV solutions cannot meet the design goal due to technical limitations (see <xref target="I-D.ietf-savnet-intra-domain-problem-statement"/> and <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/>).</t>
      <t>Existing advanced SAV solutions (e.g., EFP-uRPF <xref target="RFC8704"/> and BAR-SAV <xref target="I-D.ietf-sidrops-bar-sav"/>) typically generate ingress SAV allowlist filters on interfaces facing a customer or lateral peer AS by using information related to the customer cone of that AS. The allowlist must contain all prefixes belonging to the corresponding customer cone. When adopting SAV based on the allowlist, the interface only allows incoming data packets using source addresses that are covered in the allowlist. However, using an allowlist may cause legitimate traffic to be blocked if the allowlist fails to cover all prefixes in the customer cone.</t>
      <t>This document analyzes potential improper block problems when using the allowlist. To enhance the SAV robustness and avoid improper block, this document provides an additional option for network operators, i.e., generating a blocklist filter by using BGP updates, ROAs, and ASPAs related to the provider cone. The blocklist should contain as many prefixes belonging to the provider cone as possible. When adopting SAV based on the blocklist, the interface blocks incoming data packets using source addresses that are covered in the blocklist. Network operators can flexibly use the allowlist or blocklist on different interfaces according to their requirements and actual conditions.</t>
      <t>The reader is encouraged to be familiar with <xref target="RFC8704"/>, <xref target="I-D.ietf-sidrops-aspa-profile"/>, <xref target="RFC6482"/>, and <xref target="I-D.ietf-sidrops-aspa-verification"/>.</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="terminology">
      <name>Terminology</name>
      <t>Improper Block: The validation results that the packets with legitimate source addresses are blocked improperly due to inaccurate SAV filters.</t>
      <t>Provider Cone: the set of ASes an AS can reach by using only customer-to-provider links.</t>
    </section>
    <section anchor="sec-review">
      <name>Improper Block When the Allowlist is Incomplete</name>
      <t>The basic idea of existing advanced SAV solutions is generating an allowlist by using information related to the customer cone of a customer or lateral peer AS. Specifically, they identify prefixes in the customer cone and only accepts data packets using source addresses belonging to these prefixes on the interface facing that customer or lateral peer AS. This is because data packets received from a customer or lateral peer AS should use source addresses belonging to the customer cone of that AS unless there is a route leak <xref target="RFC7908"/>.</t>
      <t>EFP-uRPF (BCP84 <xref target="RFC8704"/>) generates allowlists by using BGP UPDATE messages related to the customer cone. However, if a multi-homed AS in the customer cone limits the propagation of its prefixes, EFP-uRPF may miss these prefixes in the allowlist, resulting in improper block. Section 3.3 of <xref target="RFC8704"/> has given such an example of limited propagation of prefixes where a multi-homed customer AS attaches NO_EXPORT to all prefixes announced to one transit provider. <xref target="fig-example"/> illustrates a similar scenario of limited propagation of prefixes in the customer cone of AS4. Since AS1 attaches NO_EXPORT to routes for P1 and P2 announced to AS2, routes for P1 and P2 are not propagated on the AS2-AS4 interface. Because AS4 never receives routes for P1 and P2 from its customer AS2, both EFP-uRPF Algorithm A and Algorithm B at AS4 will block legitimate data packets received on AS4-AS2 interface with source addresses in P1 or P2.</t>
      <figure anchor="fig-example">
        <name>An example of limited propagation of prefixes in the customer cone</name>
        <artwork><![CDATA[
                        P1[AS5 AS3 AS1]
                        P2[AS5 AS3 AS1]
               +---------+ (P2P/C2P) +---------+
               |   AS4   +<----------+   AS5   |
               +---------+           +---------+
                    /\                 /\
      P1 and P2 not /                  / P1[AS3 AS1]
       propagated  /                  /  P2[AS3 AS1]
            (C2P) /                  /   (C2P)
           +---------+       +---------+
           |   AS2   |       |   AS3   |
           +---------+       +---------+
                 /\           /\
P1[AS1] NO_EXPORT \           / P1[AS1]
P2[AS1] NO_EXPORT  \         /  P2[AS1]
            (C2P)   \       /   (C2P)
                   +---------+
                   |   AS1   |
                   +---------+
                      P1, P2 (prefixes originated)
]]></artwork>
      </figure>
      <t>Some more recent SAV solutions (e.g., BAR-SAV <xref target="I-D.ietf-sidrops-bar-sav"/>) additionally use Autonomous System Provider Authorization (ASPA) <xref target="I-D.ietf-sidrops-aspa-profile"/> and Route Origin Authorization (ROA) <xref target="RFC6482"/> to generate a more robust allowlist. However, since registering ASPAs and ROAs is optional for network operators, ASPAs and ROAs will be partially deployed for a long time. When some ASes in the customer cone do not register ASPAs or ROAs, the SAV solution will still fail to discover all prefixes in the customer cone. If the allowlist is not complete, it will improperly block data packets using legitimate source addresses.</t>
      <t>Overall, considering the complexity of inter-domain routing, existing SAV solutions which solely use allowlist filters may fail to identify all prefixes of the customer cone (e.g., when some prefixes are limited propagated in the customer cone). In this case, the incomplete allowlist will result in improper block.</t>
    </section>
    <section anchor="sec-goal">
      <name>Goals of Bicone SAV</name>
      <t>Bicone SAV aims to achieve more robust ingress SAV filtering on interfaces facing a customer or lateral peer AS by flexibly using allowlist or blocklist filters. It has two main goals:</t>
      <ol spacing="normal" type="1"><li>
          <t>Avoiding improper block. Bicone SAV aims to avoid block legitimate data packets received from a customer or lateral peer AS. As described in <xref target="sec-review"/>, if the allowlist is incomplete, it will improperly block legitimate data packets. In this case, it is recommended to use a blocklist to avoid improper block.</t>
        </li>
        <li>
          <t>Maintaining directionality. When using an allowlist, the SAV filter can block data packets using source addresses not belonging to the customer cone of the customer or lateral peer AS. When using a blocklist, the SAV filter can block data packets using source addresses belonging to the provider cone. It cannot prevent an AS in the customer cone of a customer or lateral peer AS from using source addresses of the customer cone of another customer or lateral peer AS. Therefore, the allowlist filter has stricter directionality than the blocklist filter.</t>
        </li>
      </ol>
      <t>Overall, the blocklist performs better in achieving the first goal while the allowlist performs better in achieving the second goal. In the following, this document introduces existing allowlist-based SAV solutions and the design of a new blocklist-based SAV solution.</t>
    </section>
    <section anchor="allowlist-based-sav-solution">
      <name>Allowlist-based SAV Solution</name>
      <t>Existing SAV solutions (e.g., EFP-uRPF <xref target="RFC8704"/>, BAR-SAV <xref target="I-D.ietf-sidrops-bar-sav"/>) can be used to generate an allowlist on interfaces facing a customer or lateral peer AS by using BGP updates, ROAs, and ASPAs related to the corresponding customer cone.</t>
    </section>
    <section anchor="sec-generate">
      <name>Blocklist-based SAV Solution</name>
      <t>This section introduces a blocklist-based SAV solution that generates blocklist filters on interfaces facing a customer or lateral peer AS by using BGP updates, ROAs, and ASPAs related to the provider cone.</t>
      <section anchor="key-idea">
        <name>Key Idea</name>
        <t>The provider cone of an AS is defined as the set of ASes an AS can reach by using only customer-to-provider links. Considering prefixes associated with ASes in the provider cone should not be used as source addresses in data packets received from any customer or lateral peer AS unless there is a route leak <xref target="RFC7908"/>. The blocklist should contain prefixes belonging to the provider cone.</t>
        <t>To generate a blocklist, an AS first identifies ASes in its provider cone by using ASPAs and AS-PATH in BGP UPDATE messages. Then, it discovers prefixes belonging to these ASes in provider cone and includes those prefixes in the blocklist. When using the blocklist on an interface facing a customer or lateral peer AS, data packets received from that interface using source addresses in the blocklist should be blocked.</t>
      </section>
      <section anchor="generation-procedure">
        <name>Generation Procedure</name>
        <t>A detailed description of blocklist generation procedure is as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Create the set of all directly connected Provider ASNs. Call it AS-set Z(1).</t>
          </li>
          <li>
            <t>Create the set of all unique AS_PATHs in Adj-RIBs-In of all interfaces facing Providers.</t>
          </li>
          <li>
            <t>For each unique AS_PATH with N (N&gt;1) ASNs, i.e., [ASN_{1}, ASN_{2}, ..., ASN_{i}, ASN_{i+1}, ..., ASN_{N}] where ASN_{i} is the ith ASN in AS_PATH and the first ASN (i.e., ASN_{1}) is a directly connected Provider ASN. If all unique AS_PATHs have been processed, go to Step 8.</t>
          </li>
          <li>
            <t>Let i = N</t>
          </li>
          <li>
            <t>Decrement i to i-1.</t>
          </li>
          <li>
            <t>If ASN_{i} authorizes ASN_{i+1} as a Provider in ASN_{i}'s ASPA, ASNs from ASN_{1} to ASN_{i+1} (i.e., ASN_{1}, ASN_{2}, ..., ASN_{i}, and ASN_{i+1}) are included in AS-set Z(1) and go to Step 3.</t>
          </li>
          <li>
            <t>If i == 1, go to Step 3. Else, go to Step 5.</t>
          </li>
          <li>
            <t>Let k = 1.</t>
          </li>
          <li>
            <t>Increment k to k+1.</t>
          </li>
          <li>
            <t>Create AS-set Z(k) of ASNs that are not in AS-set Z(k-1) but are authorized as Providers in ASPAs of any ASN in AS-set Z(k-1).</t>
          </li>
          <li>
            <t>If AS-set Z(k) is null, then set k_max = k-1 and go to Step 12. Else, form the union of AS-set Z(k) and AS-set Z(k-1) as AS-set Z(k) and go to Step 9.</t>
          </li>
          <li>
            <t>Select all ROAs in which the authorized origin ASN is in AS-set Z(k_max). Form the union of the sets of prefixes in the selected ROAs. Call it Prefix-set P1.</t>
          </li>
          <li>
            <t>Using the routes in Adj-RIBs-In of all interfaces facing Providers, create a set of prefixes originated by any ASN in AS-set Z(k_max). Call it Prefix-set P2.</t>
          </li>
          <li>
            <t>Form the union of Prefix-set P1 and Prefix-set P2. Apply this union set as a blocklist on an interface facing a customer or lateral peer AS.</t>
          </li>
        </ol>
      </section>
      <section anchor="overlap-between-provider-cone-and-customer-cone">
        <name>Overlap Between Provider Cone and Customer Cone</name>
        <t>In some scenarios (e.g., the CDN and DSR scenario described in <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="I-D.ietf-sidrops-bar-sav"/>), a prefix may exist both in the provider cone and the customer cone. To avoid improper block, the blocklist must remove prefixes that also belong to the customer cone. These prefixes can be identified by computing the overlap between blocklist and allowlist.</t>
      </section>
      <section anchor="incremental-deployment-of-aspas">
        <name>Incremental Deployment of ASPAs</name>
        <t>Note that it is difficult for an AS to identify all ASes in its provider cone when some ASes in the provider cone do not register ASPAs. Therefore, the generated blocklist will not include all prefixes in the provider cone. When the blocklist is incomplete, the blocklist will not improperly block legitimate data packets and will still block spoofing data packets using source addresses in the blocklist. It provides immediate incremental benefits to adopters.</t>
      </section>
    </section>
    <section anchor="sec-ops">
      <name>Implementation and Operations Considerations</name>
      <t>Network operators are advised to flexibly use either allowlist or blocklist on interfaces facing different customer or lateral peer ASes according to their requirements and actual conditions.</t>
      <section anchor="meeting-the-goals">
        <name>Meeting the Goals</name>
        <t>The primary goal of SAV is to avoid improper block while maintaining directionality. Avoiding improper block is more important because discarding legitimate traffic will cause serious traffic interruption. On the basis of avoiding improper block, the less improper admits of SAV, the better.</t>
        <t>If the allowlist on an interface is complete, it will have no improper block and no improper admit. But if the allowlist is incomplete due to hidden prefixes (e.g., prefixes P1 and P2 in <xref target="fig-example"/>) in the customer cone and lack of necessary ASPAs, the allowlist will have improper block, thus failing to meet the goal. For a blocklist, it will not improperly block legitimate data packets whether the blocklist is complete or not. In terms of improper admit, the blocklist has much less improper admits than loose uRPF and has more improper admits than the allowlist.</t>
        <t>Therefore, if the allowlist on an interface is complete, network operators are advised to use the allowlist. Otherwise, network operators are advised to use the blocklist. For small ISPs with a smaller customer cone size, it is easier to determine whether an allowlist is complete because there are fewer ASes in the customer cone and the routing is relative simple. For example, they can ask a customer or lateral peer AS whether all ASes in its customer cone have deployed ASPAs. But for large ISPs with a larger customer cone size, it is challenging. If network operators cannot determine the integrity of the allowlist, the blocklist is recommended to avoid possible improper block.</t>
      </section>
      <section anchor="storage-overhead">
        <name>Storage Overhead</name>
        <t>Additional memory (i.e., ternary content-addressable memory (TCAM)) is required to store the allowlist or blocklist in line cards. Network operators need to take storage overhead into consideration when deploying allowlists or blocklists. Generally, a small ISP will generate a smaller allowlist and a larger blocklist, while a large ISP will generate a larger allowlist and a smaller blocklist. A possible way to save memory is to store the original list in the control plane, with only the aggregated list stored in memory. For example, if the original list contains prefixes P1 and P2 and prefix P1 is a less-specific prefix of prefix P2, then only prefix P1 is stored in memory.</t>
      </section>
      <section anchor="summary-of-recommendations">
        <name>Summary of Recommendations</name>
        <t>For an interface facing a customer or lateral peer AS:</t>
        <ol spacing="normal" type="1"><li>
            <t>If the network operator can determine that the allowlist covers all prefixes of the facing customer cone, it is recommended to use an allowlist on the interface because the complete allowlist has neither improper block nor improper admit. When the customer cone size is relatively small, it would be easier for the network operator to determine whether the allowlist is complete, and the allowlist size should be relatively small as well.</t>
          </li>
          <li>
            <t>If the network operator cannot determine the integrity of the allowlist, it is recommended to use a blocklist filter to avoid improper block. In addition, given the storage overhead, the blocklist should be more appropriate than the allowlist on interfaces facing a very large customer cone.</t>
          </li>
        </ol>
        <t>For example, in <xref target="fig-example"/>, it is recommended that AS4 uses the blocklist filter at AS4-AS2 interface, since the use of the allowlist filter here may have improper block problems. If AS4 can ensure that the use of allowlist filter at AS4-AS5 interface will not cause improper block, then it is recommended to use allowlist filter at AS4-AS5 interface. In this way, SAV at AS4 can avoid improper block while maintaining directionality. For data packets received from AS5, SAV at AS4 will block data packets using source addresses not belonging to AS1, AS3, and AS5. For data packets received from AS2, SAV at AS4 will block data packets using source addresses belonging to the provider cone of AS4.</t>
      </section>
    </section>
    <section anchor="sec-security">
      <name>Security Considerations</name>
      <t>The security considerations described in <xref target="RFC8704"/>, <xref target="I-D.ietf-sidrops-bar-sav"/>, <xref target="I-D.ietf-sidrops-aspa-profile"/>, <xref target="RFC6482"/>, and <xref target="I-D.ietf-sidrops-aspa-verification"/> also applies to this document. Users should be aware of the potential risks of using ASPAs and ROAs to generate SAV filters, such as misconfiguration and update delay of RPKI repository.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA requirements.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC8704" target="https://www.rfc-editor.org/info/rfc8704" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8704.xml">
          <front>
            <title>Enhanced Feasible-Path Unicast Reverse Path Forwarding</title>
            <author fullname="K. Sriram" initials="K." surname="Sriram"/>
            <author fullname="D. Montgomery" initials="D." surname="Montgomery"/>
            <author fullname="J. Haas" initials="J." surname="Haas"/>
            <date month="February" year="2020"/>
            <abstract>
              <t>This document identifies a need for and proposes improvement of the unicast Reverse Path Forwarding (uRPF) techniques (see RFC 3704) for detection and mitigation of source address spoofing (see BCP 38). Strict uRPF is inflexible about directionality, the loose uRPF is oblivious to directionality, and the current feasible-path uRPF attempts to strike a balance between the two (see RFC 3704). However, as shown in this document, the existing feasible-path uRPF still has shortcomings. This document describes enhanced feasible-path uRPF (EFP-uRPF) techniques that are more flexible (in a meaningful way) about directionality than the feasible-path uRPF (RFC 3704). The proposed EFP-uRPF methods aim to significantly reduce false positives regarding invalid detection in source address validation (SAV). Hence, they can potentially alleviate ISPs' concerns about the possibility of disrupting service for their customers and encourage greater deployment of uRPF techniques. This document updates RFC 3704.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="84"/>
          <seriesInfo name="RFC" value="8704"/>
          <seriesInfo name="DOI" value="10.17487/RFC8704"/>
        </reference>
        <reference anchor="I-D.ietf-sidrops-aspa-profile" target="https://datatracker.ietf.org/doc/html/draft-ietf-sidrops-aspa-profile-18" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-sidrops-aspa-profile.xml">
          <front>
            <title>A Profile for Autonomous System Provider Authorization</title>
            <author fullname="Alexander Azimov" initials="A." surname="Azimov">
              <organization>Yandex</organization>
            </author>
            <author fullname="Eugene Uskov" initials="E." surname="Uskov">
              <organization>JetLend</organization>
            </author>
            <author fullname="Randy Bush" initials="R." surname="Bush">
              <organization>Internet Initiative Japan</organization>
            </author>
            <author fullname="Job Snijders" initials="J." surname="Snijders">
              <organization>Fastly</organization>
            </author>
            <author fullname="Russ Housley" initials="R." surname="Housley">
              <organization>Vigil Security, LLC</organization>
            </author>
            <author fullname="Ben Maddison" initials="B." surname="Maddison">
              <organization>Workonline</organization>
            </author>
            <date day="25" month="June" year="2024"/>
            <abstract>
              <t>This document defines a Cryptographic Message Syntax (CMS) protected content type for Autonomous System Provider Authorization (ASPA) objects for use with the Resource Public Key Infrastructure (RPKI). An ASPA is a digitally signed object through which the issuer (the holder of an Autonomous System identifier), can authorize one or more other Autonomous Systems (ASes) as its upstream providers. When validated, an ASPA's eContent can be used for detection and mitigation of route leaks.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-sidrops-aspa-profile-18"/>
        </reference>
        <reference anchor="RFC6482" target="https://www.rfc-editor.org/info/rfc6482" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6482.xml">
          <front>
            <title>A Profile for Route Origin Authorizations (ROAs)</title>
            <author fullname="M. Lepinski" initials="M." surname="Lepinski"/>
            <author fullname="S. Kent" initials="S." surname="Kent"/>
            <author fullname="D. Kong" initials="D." surname="Kong"/>
            <date month="February" year="2012"/>
            <abstract>
              <t>This document defines a standard profile for Route Origin Authorizations (ROAs). A ROA is a digitally signed object that provides a means of verifying that an IP address block holder has authorized an Autonomous System (AS) to originate routes to one or more prefixes within the address block. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6482"/>
          <seriesInfo name="DOI" value="10.17487/RFC6482"/>
        </reference>
        <reference anchor="I-D.ietf-sidrops-aspa-verification" target="https://datatracker.ietf.org/doc/html/draft-ietf-sidrops-aspa-verification-18" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-sidrops-aspa-verification.xml">
          <front>
            <title>BGP AS_PATH Verification Based on Autonomous System Provider Authorization (ASPA) Objects</title>
            <author fullname="Alexander Azimov" initials="A." surname="Azimov">
              <organization>Yandex</organization>
            </author>
            <author fullname="Eugene Bogomazov" initials="E." surname="Bogomazov">
              <organization>Qrator Labs</organization>
            </author>
            <author fullname="Randy Bush" initials="R." surname="Bush">
              <organization>Internet Initiative Japan &amp; Arrcus, Inc.</organization>
            </author>
            <author fullname="Keyur Patel" initials="K." surname="Patel">
              <organization>Arrcus</organization>
            </author>
            <author fullname="Job Snijders" initials="J." surname="Snijders">
              <organization>Fastly</organization>
            </author>
            <author fullname="Kotikalapudi Sriram" initials="K." surname="Sriram">
              <organization>USA National Institute of Standards and Technology</organization>
            </author>
            <date day="8" month="July" year="2024"/>
            <abstract>
              <t>This document describes procedures that make use of Autonomous System Provider Authorization (ASPA) objects in the Resource Public Key Infrastructure (RPKI) to verify the Border Gateway Protocol (BGP) AS_PATH attribute of advertised routes. This type of AS_PATH verification provides detection and mitigation of route leaks and some forms of AS path manipulation. It also provides protection, to some degree, against prefix hijacks with forged-origin or forged- path-segment.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-sidrops-aspa-verification-18"/>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC2827" target="https://www.rfc-editor.org/info/rfc2827" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2827.xml">
          <front>
            <title>Network Ingress Filtering: Defeating Denial of Service Attacks which employ IP Source Address Spoofing</title>
            <author fullname="P. Ferguson" initials="P." surname="Ferguson"/>
            <author fullname="D. Senie" initials="D." surname="Senie"/>
            <date month="May" year="2000"/>
            <abstract>
              <t>This paper discusses a simple, effective, and straightforward method for using ingress traffic filtering to prohibit DoS (Denial of Service) attacks which use forged IP addresses to be propagated from 'behind' an Internet Service Provider's (ISP) aggregation point. 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="38"/>
          <seriesInfo name="RFC" value="2827"/>
          <seriesInfo name="DOI" value="10.17487/RFC2827"/>
        </reference>
        <reference anchor="RFC3704" target="https://www.rfc-editor.org/info/rfc3704" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.3704.xml">
          <front>
            <title>Ingress Filtering for Multihomed Networks</title>
            <author fullname="F. Baker" initials="F." surname="Baker"/>
            <author fullname="P. Savola" initials="P." surname="Savola"/>
            <date month="March" year="2004"/>
            <abstract>
              <t>BCP 38, RFC 2827, is designed to limit the impact of distributed denial of service attacks, by denying traffic with spoofed addresses access to the network, and to help ensure that traffic is traceable to its correct source network. As a side effect of protecting the Internet against such attacks, the network implementing the solution also protects itself from this and other attacks, such as spoofed management access to networking equipment. There are cases when this may create problems, e.g., with multihoming. This document describes the current ingress filtering operational mechanisms, examines generic issues related to ingress filtering, and delves into the effects on multihoming in particular. This memo updates RFC 2827. 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="84"/>
          <seriesInfo name="RFC" value="3704"/>
          <seriesInfo name="DOI" value="10.17487/RFC3704"/>
        </reference>
        <reference anchor="I-D.ietf-savnet-intra-domain-problem-statement" target="https://datatracker.ietf.org/doc/html/draft-ietf-savnet-intra-domain-problem-statement-03" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-savnet-intra-domain-problem-statement.xml">
          <front>
            <title>Source Address Validation in Intra-domain Networks Gap Analysis, Problem Statement, and Requirements</title>
            <author fullname="Dan Li" initials="D." surname="Li">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Jianping Wu" initials="J." surname="Wu">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Lancheng Qin" initials="L." surname="Qin">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Mingqing(Michael) Huang" initials="M." surname="Huang">
              <organization>Huawei</organization>
            </author>
            <author fullname="Nan Geng" initials="N." surname="Geng">
              <organization>Huawei</organization>
            </author>
            <date day="13" month="February" year="2024"/>
            <abstract>
              <t>This document provides the gap analysis of existing intra-domain source address validation mechanisms, describes the fundamental problems, and defines the requirements for technical improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-savnet-intra-domain-problem-statement-03"/>
        </reference>
        <reference anchor="I-D.ietf-savnet-inter-domain-problem-statement" target="https://datatracker.ietf.org/doc/html/draft-ietf-savnet-inter-domain-problem-statement-04" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-savnet-inter-domain-problem-statement.xml">
          <front>
            <title>Source Address Validation in Inter-domain Networks Gap Analysis, Problem Statement, and Requirements</title>
            <author fullname="Dan Li" initials="D." surname="Li">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Jianping Wu" initials="J." surname="Wu">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Libin Liu" initials="L." surname="Liu">
              <organization>Zhongguancun Laboratory</organization>
            </author>
            <author fullname="Mingqing(Michael) Huang" initials="M." surname="Huang">
              <organization>Huawei</organization>
            </author>
            <author fullname="Kotikalapudi Sriram" initials="K." surname="Sriram">
              <organization>USA National Institute of Standards and Technology</organization>
            </author>
            <date day="19" month="March" year="2024"/>
            <abstract>
              <t>This document provides the gap analysis of existing inter-domain source address validation mechanisms, describes the fundamental problems, and defines the requirements for technical improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-savnet-inter-domain-problem-statement-04"/>
        </reference>
        <reference anchor="I-D.ietf-sidrops-bar-sav" target="https://datatracker.ietf.org/doc/html/draft-ietf-sidrops-bar-sav-03" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-sidrops-bar-sav.xml">
          <front>
            <title>Source Address Validation Using BGP UPDATEs, ASPA, and ROA (BAR-SAV)</title>
            <author fullname="Kotikalapudi Sriram" initials="K." surname="Sriram">
              <organization>USA National Institute of Standards and Technology</organization>
            </author>
            <author fullname="Igor Lubashev" initials="I." surname="Lubashev">
              <organization>Akamai Technologies</organization>
            </author>
            <author fullname="Doug Montgomery" initials="D." surname="Montgomery">
              <organization>USA National Institute of Standards and Technology</organization>
            </author>
            <date day="4" month="March" year="2024"/>
            <abstract>
              <t>Designing an efficient source address validation (SAV) filter requires minimizing false positives (i.e., avoiding blocking legitimate traffic) while maintaining directionality (see RFC8704). This document advances the technology for SAV filter design through a method that makes use of BGP UPDATE messages, Autonomous System Provider Authorization (ASPA), and Route Origin Authorization (ROA). The proposed method's name is abbreviated as BAR-SAV. BAR-SAV can be used by network operators to derive more robust SAV filters and thus improve network resilience. This document updates RFC8704.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-sidrops-bar-sav-03"/>
        </reference>
        <reference anchor="RFC7908" target="https://www.rfc-editor.org/info/rfc7908" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7908.xml">
          <front>
            <title>Problem Definition and Classification of BGP Route Leaks</title>
            <author fullname="K. Sriram" initials="K." surname="Sriram"/>
            <author fullname="D. Montgomery" initials="D." surname="Montgomery"/>
            <author fullname="D. McPherson" initials="D." surname="McPherson"/>
            <author fullname="E. Osterweil" initials="E." surname="Osterweil"/>
            <author fullname="B. Dickson" initials="B." surname="Dickson"/>
            <date month="June" year="2016"/>
            <abstract>
              <t>A systemic vulnerability of the Border Gateway Protocol routing system, known as "route leaks", has received significant attention in recent years. Frequent incidents that result in significant disruptions to Internet routing are labeled route leaks, but to date a common definition of the term has been lacking. This document provides a working definition of route leaks while keeping in mind the real occurrences that have received significant attention. Further, this document attempts to enumerate (though not exhaustively) different types of route leaks based on observed events on the Internet. The aim is to provide a taxonomy that covers several forms of route leaks that have been observed and are of concern to the Internet user community as well as the network operator community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7908"/>
          <seriesInfo name="DOI" value="10.17487/RFC7908"/>
        </reference>
      </references>
    </references>
    <?line 240?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1c63bbxrX+j6eYY/+o1JCMKdu1rZWkoSQ70aotsaLcnjb1
yhoCQ3IqEGAwgGTGVZ6lz3Ke7Hx7zwAYgCAlOT2XddbJSmxiMJe99+zrN4P0
+/0g13msDsWRDtNEiUlaZKESoyjKlDHiTzLWkcx1mgRyOs3Udd1x9KcgSsNE
LjE4yuQs78e6b3SUpSvTn3KnvpHX/SdPg3Rq0ljlyhwGxQrT0Q/66zAI8ec8
zdaHwuRRYIrpUhuD1S7XK0x7+vryTRDoVXYo8qww+cGTJ6+eHAQyU/JQnK9U
xpQZIZNIvJOJnKulSvLgJs2u5llarA7F5PTk4nw8Ca7UGq3RIZMdyCJfpNlh
IPqBEDoxh+JkIN5qPFh2TmRiH9NsLhP9My9zKC6NTuaLQor3ib5WmdH5Gn3U
UuoYBKYkqeTb3HUaqKgYhAk6hOgHsSn9d7yh57RIcmL5eKET6RHxdiD+qJOK
ircyCRcqmbvGJi1/XaTJfF6gSwFa5TSFLCDHmp6fdBKH39Lvwc/zMJbTzyPo
GBTUFOny+YHExJo4+fbXEPJWFx4dU524lgdTUsTThxISJGm2xArX0FghLt4c
v3zx5Bn9PO2fDLTKZ5XeS7OS/VWWznRc9v3ds5cH2/tCj/RMh5b8QCez1koH
Lw9euJ9PNxaV14nK+xqkyn6UgsGE1p7Gatk3OSyLrGHLCJXdc0Rp0DKj0Y6U
F6+evDwMgsFgEAT9fl/IqQENYR4ElwslVpleymwtImX0PBHzVMYinQljXYt0
ruW6ci1iD1a5LzQM+TrVEbZA6CXIgoGLaZyGV2JPD9SgZx/odazmOsciuYJj
kDMIcF/cLCBzQSzl+I96RTpTIS2AlfJ1TyizUqGWcbyGVomVzHI8gMpVnK6J
cWFClchMp0bsGaXEp08PE9ztLXuiH5yCfNgfiNcftcmJFhldQylVRA4IkogL
67n2qs481F+xKfjb232Rr1fQFCJ/rhJyfgp8zFmYNCvepDcx1hPQPtBpBETL
FM9kqIzAn0yJCOFK0yWEm2YixiwZpLBSeB5NBuJygX2AYy9YInCq8fpnDF6l
OZ5JXq2tcVIwkL9KREHeT+RQgooaTJkKlSyIfX5DtGIQiEiIdOKb9701cw+d
fVLw7lpDpTCAdEjbjRXpilUIdiOwQ+T6RcqRIc1MT1i9ceKy3PPknpjEdO3I
PvpuLFx86omL8xH+JOJGk/HIiEyRqCL4eWbCUZMJinMDcdZeWoQgcxarj3oa
0/yqKRQSfU0I6I/0bKYy4tPbMRmGCFosUV5VZyDjpwJqTRJxogvzAmIAGVYk
BibJNrnUURSrIHgsTuEg0qhgUxCfHhsVss9Ib4Ng0rRJs0rhusj+SHkUWS2R
vUxBpIGnSgv0UWGRwZ7wBnEYVBBtaSTXvzG0ksqwDQNxygOuiQn8y2YpZJ5L
aMw1jBLsz1j7sjmyBCi1EieQRKanBQn5RCXaOo0JJtGgcO/kJJ3suyks56Ax
TJfLNLECjsioMwWZh+Q/BQ0o+7MOLiGfORmN6Wa6ByqT9Z1uyjNeNZhDu46O
x09fstWTs7aGjLaXz2DOzm3DM9ReQSwkyJsqmAvpewrSyey2+s2mx/i/6CW/
T28UAmEPElDXrGRNnmFLSZqLpVI566MvoKhQrIEqXCTkHRHhsdEuMdxO4I6I
6Qh8OF/7ML07Hb7Vmddvxv3iYvxGNP3/0eiiT/3/x+NA7RSrlCRN2j6wGh9W
vkLmLoj4vm6JftQnZycQx7TNM/0RpExVjHytdnDolYGPFTkzNDYWGIg/U4SR
EXl8vCRWp5LsHpQ1nGuPHyuOBXsIfgvzSeAzWO1lLqHd4ZWCC7OsNi0f5DE/
qDawPtTTephWbKtU104hE59vuYbqku/ftERieKqsrdLEs1Z8mCFbZdfKSzel
5qhoSYdyr/8P3Q8P3aSr9cRmkRZxVGursUFhu8Y2ZqP+cOgGQf9ufa0Wbesr
v/gXqWq1yP+2HIXEjvyBJAdVUeC1yFDAR84wZnKpYy0zcaPzRe0le12u0S+6
bm973Juqrg+9bUn1Rul1ewuSHj8WFz7pKMBRSs6VJfZKrQVhCEY8evd+cvmo
Z/8WZ+f8++L1H9+fXrw+od+T70dv31Y/Atdj8v35+7cn9a965PH5u3evz07s
YLSKRlPw6N3oL48sL4/Ox5en52ejt4/sBjcMPlNOeLw9UFlSemkCWF6IzMoq
BTKT//jnkHKTf6OMZTh8hXhnH14OX1CmQt7ArsaO0z5iZ9eBXK0UtsR58VCu
EGhjMjVDdnOTiAXUA4L87Q8kmQ+H4qtpuBo++8Y1EMONxlJmjUaW2WbLxmAr
xI6mjmUqaTbaW5Ju0jv6S+O5lLvX+NXvYw2T7w9f/v6bgPLsS5XBXtM4na+D
4LT0iEdkQofsZrxcEmZbxLmzW/Yjzr5Z3714sWHptM1V2HCLYJtcHqQTGGTB
OQE5HJcBYE/GpZ86hp865CUN0ilE7dHEemZEfXIIMMpwUXtW1oEy1PTztF85
PHB/RTOjwGjwav0eLTCqXImm2gDubEUwoKtBKNdTN7fWuuAZERQxrySS1B1Z
FKbzA4MfdD8rcbmjJp5QRjyzOZc1BaIUMXW23h2VayvCrqgVtvc+vrwdY4yq
V3Gxow4WLptjPbq7sNc0u81JGpSgBFAomiIxy9LlHamhC5E0x52kb80RRZHE
lELk5DK4qEFigdoPqi+v2IMTxvSB0poqV96zVZVXSZX5r6kVwDSTgvfjk9Hl
a5QOxsCTb+QCrRyqyuY06cQSFqr7C7ynTKJ7g7naMGUmsJJzq3BglJrLbfMS
fkoKCeRub2w7tew5F2FVuZVgQSVtzSaeDp7SYnUZsYAznmMrE2EK2DFsQ32U
ZHfUjakFNy1SKyJueDeanFf8jlw5DbrhYn98/e/j84tLEmQjOaVSrWCTxRuS
EBLexOgqCcwGiDYzPe87shBwdBwXhB/yPgoDGmNEmbLMvA/dnVvDru0ZRKUp
fR1NhlvIZ70znIaOh2yx44MmG6PJQW9LN4iLStOSsDq7w5g+lq8tdSCOnOVR
c0J6Vpqd6Z6cbZHUyNsCEDJNESEqfRrF8zRDzFiKkU15q+cjwZb2DCEFG2RT
fi+wdNt/SnHgGSg/8HwMx6QNW4fQQStRfIAo8MsvvwRiyz/j4Q+jyXNM/JS2
4cP2fgc7+33RL//5QuyND8ZfHh+M9/3W9oB/4D8SAIZ+1fcGU+tzer9rhc7W
TtK//FtHU1CyXu4mqcmXHYOtdJoce+rUPcaKqkNMeyyT7jH2pd99k98tvFpJ
HrhfdctT0ZLivWd0VP2t8RCwLIYfPANtdBDufcDsN/p5HUvxdIqm7tgpkQ4+
ul5b7odt7u85WpBe9Egp9urAnmnETdryfbalT4fisecmBR/Tfv1o9CB/3uUX
HzHsuyRUN1Ns+KgdOkGq+6FRdUHvishRkadJumQYb21ytRRV7jnig1d3Wif2
qDzfv7uiYwu64OzgnKXUngcF/35d9ZHHroAx6dhk0KITuDEcHjI4RtCaUbi1
qAEvej7inMkiFciBtmAVrRHW4aoSPKXsnOFTyq8wgRSUJGFHlyVIYGg/OA/v
jGRRyt6jpNEth5ks0lEiM+UG2vWRQONPwpFIIJE290aSTttgFCRA65f5O9Kj
3K7h1R82vnSktztqGYSN82vKLeMeLW1IR0oQyi72kQ4aKJnyoFcOlozXV2VC
U31vFjqkeBUrp5GbiChlYaVoqlS+IRp39NHcCGcYN9We1WlPpjassUZhGrPs
Q8Kudg+lUSX6U1VHNbUsY5sGduSAVHl9l6IAJ1rrWxmuuiJwHJbutUu9ZEQR
KZCG6jcMw8ePrYxs7fc5uLGHKHH/bjyprEzppIhyVtiUPSUiws1hEAwHYtR9
0DEQXVwxDnnPLOfuKgeLG9EATj598orW294mZKuNt4s7bGQLdW2t0DwjSE6X
S5VENhNlbfakWDG+oRsHA/Fu6ymPczubmHXtTBzCSojAVtPeSAnJS9ynBFS7
Re8T14ZJP5u23cgt66E7Z6JTKIugby377sIMrIZtoaTTtdCMWHxBz7vLeJRo
iCLOb7RdG9sSHaSG9NDcdaq9W6iwG+U74uZ7qBTBKCS+nGYk7I/9R+mnZzpD
Nz6Ks2eLTaruHA+jShE3aQJnAZgzpfHs4psQp3Yn2RBiDRGVa/Utut6MBRST
vSND3rdE3dQcdoxizzrqmHbiOnjHfPc83btvMsUqrexxdiON8SGuX3Oc95CD
kp2HcSSjow4hljIqw5Dj4NYdTxmHW3g7KXduhgWMaqBnI4L8t4mj6S/4uOAP
ai1OIyXLe0/+URAbNDsQCiQznTAY/68DXgnIrTKmOg8xJg01k81Vu59UNulz
MJ512VbjyHV0VPm7Ymiy3ino+6J8Ow/h7nn4RodKjczfixxWytZXuXxPY8JS
Ohar86VTbUOd2o8m/fHo8ns+RNlEFpmHhMN2mWub7ZSbOt1vHSDSxZYkjIuI
D/XSDojQO9L7c/PgtnFaJz2zuJdV9HZtNFthPd+WyNamsNzJ+qTb2s13DrwH
magNQxUVmQqCEewEGx5jTZt5rcqCtp5wXo9clSNZsYyLGi51PKa7Scq3Nsru
bTwku0qTBL+wUl2bTs7IqKibJtysT+P+ujfcJ193sG3GItE/FbSZP5JusARG
0d/7F6dHpn+alL02/VO5LNVATwfiDbaDzb85n7XhM7F39s1wnyksz8V/wMOP
n4a3VHvixwF+DAYD96TLZv3FsPHi7PaDw3hdPxIdlx/sKs6YfLd0GTmt0dBL
d7/IrWwvbN4lUq4muwTVuAQVkvpEPWQBZB+TXK3ESwjm2UC8hai1+FqcBcHz
gThRoT2cRRtVbv0hev2O1ygZkg4aYOt2IrB30CqymEnu/RvD9s08GavojjsL
+5bjm5xvlbn1Em7QPteEzpYju2ilU9zV4/Yp+HjBfIDZr8Ww13wpXsdUEnht
zzHgpRXPFcRDcnhF+VMpnyvqefUFtQ+fVMpbUXC1bwPQmXdzgCKBT+VVH3RO
C/uyEitHiUp77QBGI2YcDCol8iYhGoZuk+r1CVQoXMKZsEld/biUH8EMxrTl
MzwoZUDZJOslFMo6B39S56c9BqTZ6ODN+4poO6DjFLo2yIpqMZ/EoQiczda8
pw5/Ii5Nk1Eifp8tuUWf8ximC5kzvK6yuFHtfcbcjWce8xZCBd5Xbt4dFjzY
1fREaNVAlh6sA32kyNe5kY6/LhIJ/x8+6+K9wYhFwhvjxGi1itc2y7eD6IVs
JIWfFcxsnKGiJpYrcaTyG3I1jUNwJue4nIJaguDU4TreHUeb0hNXxydnPOZk
clGfTrUwgs+6C7mzJoBbcfvEqBXXPfYMqDOtK912K12/7AYK2uUeX9WDC0H6
UiuH9RCxSV0as+Xw9LJ5oOlKmSrbYs0ieITBO54gddszddtT08G3hiqwlvey
8m3Y5JP6Nio7ADigIDhLOTxTnsLQCV1X0iFhZwy6cgbYhvu2J4A3nbhss08n
LrtRopcZaeTxx8iQdbgcHzph2RZAUV2rqKdpQU7Nl/Ua90SgWOoedmw7V3fC
7wOybKaop971P71cqkjb+6r1Zk4hn5m2F8n5tpzNivhaSWw7cb5H1HkffZXl
j3u05SZMB5Xm5k03DmHRtXZ1dePSm9KMumy/97bpUuubcDtc0K+4HAd1f6dU
ZSeM8ja/rfEvh2uzDQe887r3VoyVJmWAGM1plsskry+OoLyRlquOe62sP7Zj
+cVA+YrlmBWc1Q/EuVMVabTNHroJsVrNVWT1QkZ86cKy79Se4SVK1TdOL9rh
w3430EJpOR1N0rYUaIP8Vl55II6QFe3Gf8v7WAsdRcorYV04qZ7r82EOH42L
Efvb7xTF9CEF+EfGTfVntra+p40J1qxtCrUwfALilLO6W2+BuDd8TOUV0Ppz
/Al8KJvWhtOqpETHaWlugT9FMCGd9TSE3fZqhG8u6WZLp0owwhmnVDYzAEey
4hFOlTc7Ny88s5GVzntjh3dq0saxYNvpbFywhQ2QeG60echwz7fSLpklhY7T
ydhdHZS2xYeRLdyD/LU8VFCwOdoWyl5yvrSoqr1qII3+VpXmb7EcIm6mbkpH
t1VRy3zVfVTEkBp9nWM0TesKX6vw7mYd5Q3SXN2B4FXktoJ4kwJW/ers1YVn
Mt7q46OG5Lhll+DCBYmWgRyuZzY3zR0h1HItb+vNM3eU2brltWEbrRMf69bL
S+UdZ4CPUcmkdHWas92FklEQjOpL9kskc3AProKlz7PIWxC0hgjUd5Fb0tRl
z8vj0bv9fUsKxyqmAyLJdl4QxwbwfViKDabrtnmiHJYqrxRPRzSnjmaSUVod
AtuAzymY3b0G0G8aC2MtCyfx5UxZG4R1WB4eWBpGzQDH33LbPW9nw6asVWRj
LjemPVW5hGeko3rzbpC/kyhJK520beyuhesKMfqMycrUAvGElkP5Y5lAF1lb
GR7m7ZjPkYByfmkhN5qLqxG7RMvGnFNrruOQVtMVl+gvV3+gkTEfcr194y7F
li+rchKDXFHPNDbGbhBnFbhYclKDKS5K7bdpXRC8sbn7w6o/iwG6TKBtpOxh
fAN1N7DrvXTobdd9ALd6w0XsOqttnds07+56LlV0HP9T4EpcdtrKS5I020hK
qvpg03/5rhdbwlpqY3oJz7qQQH6xU2adsWIj/6mjYen769dMR40Ht8mhov9G
xbFDW3fs3cP8672O0d3Z6bbTdEpPymtOPXe7ltGblhNre/OaW84/5IpmzbSF
kdu5x7ZzLMy9do6oWXBb26gNeyN/7GR+4S6FFvaroc2zYHdrtHkFtLwmxeCO
URtyrk6fKTcgmKIj6ay+N3NQ4DM2RJWYIvOs0M2+MXNF1fPGxVSXklo76qgc
kh0KcJ8l6lsZcN49e+Mkr4j/zJqL9m3HWQsIaKzk3d/9rEsYo8mQQOqnJUD9
/B4UHPwaCu74SM5dzOZvZibl1+Sd5Xz5rbn7SKT69Dxsdm5gcLu/Fatwtf+6
L8ksVAZjj+mIkSXg3WEgIJeCS+0b5A0l086i6o81M22uOOy0zyEZoPYvB3gf
+vTcrX9D3xhASvAHRVbDJ/aoG/KKpY224z+cYuuRoOjcRWNxOjobtXaj/Wkp
B6bU9vTxjPJ/PTCFeuBn8J8F3QfIX0gAAA==

-->

</rfc>
