<?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-li-sidrops-bicone-sav-07" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.29.0 -->
  <front>
    <title abbrev="Bicone SAV">Bicone Source Address Validation</title>
    <seriesInfo name="Internet-Draft" value="draft-li-sidrops-bicone-sav-07"/>
    <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="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="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="2025" month="July" day="07"/>
    <area>Operations and Management</area>
    <workgroup>SIDROPS</workgroup>
    <keyword>SAV</keyword>
    <abstract>
      <?line 67?>

<t>The primary design goal of source address validation (SAV) is avoiding improper blocks (i.e., blocking legitimate traffic) while maintaining directionality (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>). Existing advanced SAV solutions (e.g., EFP-uRPF <xref target="RFC8704"/>) for an Autonomous System (AS) typically generate ingress SAV allowlist filters on interfaces facing a customer or lateral peer AS. This document analyzes the potential improper block problems when using an allowlist. To avoid improper blocks, this document proposes a new SAV solution by generating an ingress SAV blocklist filter which contains prefixes exclusively belonging to the provider cone. In practice, network operators can flexibly decide to use a blocklist or an allowlist according to their requirements and actual conditions.</t>
    </abstract>
  </front>
  <middle>
    <?line 72?>

<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 (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>).</t>
      <t>Existing advanced SAV solutions (e.g., EFP-uRPF <xref target="RFC8704"/>) 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. When adopting SAV based on the allowlist, the interface only allows incoming data packets using source addresses that are covered in the allowlist. Therefore, the allowlist must contain all prefixes belonging to the corresponding customer cone. Otherwise, if the allowlist is incomplete, it will improperly block legitimate traffic from the corresponding customer cone.</t>
      <t>This document analyzes the potential improper block problems when using an allowlist. To avoid improper blocks, this document proposes a new SAV solution by generating an ingress SAV blocklist filter which contains prefixes exclusively belonging to the provider cone. The blocklist is not required to be complete, but it should contain as many prefixes exclusively 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. In practice, network operators can flexibly decide to use a blocklist or an allowlist according to their requirements and actual conditions.</t>
      <t>The reader is encouraged to be familiar with <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/>, <xref target="RFC8704"/>, <xref target="I-D.ietf-sidrops-aspa-profile"/>, <xref target="RFC6482"/>, <xref target="I-D.ietf-sidrops-aspa-verification"/>, and <xref target="I-D.qin-sidrops-toa"/>.</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 (C2P) links.</t>
    </section>
    <section anchor="sec-review">
      <name>Improper Block When the Allowlist is Incomplete</name>
      <t>The basic idea of existing allowlist-based 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 belonging to the corresponding customer cone and only allows data packets using source addresses in 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>Limited propagation of prefixes or the existence of hidden prefixes can result in an incomplete allowlist, which may in turn lead to improper block problems (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/>).</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/P2C) +---------+
               |   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><xref target="fig-example"/> illustrates an example of limited propagation of prefixes in the customer cone of AS4. Arrows in the figure indicate propagation direction of BGP announcements as well as AS relationship (i.e., Provider-to-Customer (P2C), Customer-to-Provider (C2P), or Peer-to-Peer (P2P)) from sending AS to receiving AS. AS1 announces the route for prefixes P1 and P2 to its two provider ASes, i.e., AS2 and AS3. Since AS1 attaches NO_EXPORT in the BGP UPDATE message sent to AS2, AS2 will not propagate the route to AS4. As a result, AS4 only receives the route to prefixes P1 and P2 from its lateral peer or provider AS5. If AS4 uses EFP-uRPF (including Algorithm A and Algorithm B) to generate an allowlist on AS4-AS2 interface, the allowlist will not contain prefixes P1 and P2, and thus will improperly block data packets using source addresses in prefixes P1 or P2.</t>
      <figure anchor="fig-example3">
        <name>An example of hidden prefixes in the customer cone</name>
        <artwork><![CDATA[
    P3 (anycast prefix)                        
        +---------+                            
        |   AS6   |-Anycast Server             
        +---------+                            
             |                                 
     P3[AS6] |                                 
     (P2C)   |                                 
            \/                                 
        +---------+ (P2P/P2C) +---------+      
        |   AS4   +<----------+   AS5   |      
        +---------+           +---------+      
             /\                 /\             
             /                  /              
      (C2P) /                  / (C2P)         
           /                  /                
    +---------+       +---------+              
    |   AS2   |       |   AS3   |              
    +---------+       +---------+              
          /\           /\                      
           \           /                       
      (C2P) \         / (C2P)                  
             \       /                         
            +---------+                        
            |   AS1   |-Edge Server            
            +---------+                        
(AS1 never announces the route to P3)
]]></artwork>
      </figure>
      <t><xref target="fig-example3"/> illustrates an example of hidden prefixes in the Content Delivery Networks (CDN) and Direct Server Return (DSR) scenario. AS6 (where the anycast server is located) announces the route to anycast prefix P3. Although AS1 (where the edge server is located) is not authorized to announce the route to prefix P3, it will send legitimate data packets using source addresses in prefix P3 due to the DSR technology. If AS4 applies an allowlist on interface AS4-AS2, the allowlist will not contain prefix P3. Therefore, the allowlist filter on interface AS4-AS2 will improperly block data packets using source addresses in prefix P3.</t>
      <t>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"/> related to the customer cone to generate a more robust allowlist. Traffic Origin Authorization (TOA) <xref target="I-D.qin-sidrops-toa"/> can be used to further improve the completeness of the allowlist in the hidden prefixes scenario. Since registering ASPAs, ROAs, and TOAs is optional for network operators, ASPAs, ROAs, and TOAs would be partially deployed for a long time. When some ASes in the customer cone do not have ASPAs, ROAs, or TOAs, the generated allowlist may still be incomplete.</t>
      <t>In summary, considering the complexity of inter-domain routing, existing SAV solutions which use allowlist filters on interfaces facing a customer or lateral peer AS may fail to identify all prefixes belonging to the corresponding customer cone. In this case, the incomplete allowlist will have improper blocks.</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 blocks. Bicone SAV aims to avoid blocking 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 blocks.</t>
        </li>
        <li>
          <t>Maintaining directionality. Unlike Loose uRPF <xref target="RFC3704"/> which completely loses directionality, Bicone SAV aims to identify more source-spoofed data packets by maintaining directionality. In general, the allowlist filter has stricter directionality than the blocklist filter, so using an allowlist will have less improper admits.</t>
        </li>
      </ol>
    </section>
    <section anchor="sec-generate">
      <name>Blocklist Generation</name>
      <t>This section introduces how to generate a blocklist by using BGP updates, ASPAs, and TOAs 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 (C2P) links. Considering prefixes only 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 can contain prefixes only belonging to the provider cone. When using the blocklist on an interface facing a customer or lateral peer AS, it will block data packets received from that interface using any source address in the blocklist.</t>
        <t>To generate such a blocklist, an AS can first identify ASes in its provider cone by using ASPAs and AS-PATH in BGP UPDATE messages. Then, it can discover prefixes belonging to these ASes by using Traffic Origin Authorizations (TOAs) <xref target="I-D.qin-sidrops-toa"/>. Subsequently, it must remove prefixes that also belong to its customer cone. Given the uncertainty in determining whether a prefix belongs to its customer cone (as analyzed in <xref target="sec-review"/>), a conservative strategy is to retain prefixes exclusively belonging to the provider cone. This blocklist SAV filter can address the improper block problems of existing allowlist SAV filters, while maintaining directionality.</t>
      </section>
      <section anchor="subsec-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 TOAs in which the authorized origin ASN is in AS-set Z(k_max). Form the union of the sets of prefixes in the selected TOAs. Call it Prefix-set S.</t>
          </li>
          <li>
            <t>For each unique Prefix P in Prefix-set S, check origin ASNs of Prefix P by using all TOAs. If all unique Prefixes in Prefix-set S have been processed, go to Step 15.</t>
          </li>
          <li>
            <t>For each prefix of Prefix P and its sub prefixes, if the prefix has at least one origin ASN not in AS-set Z(k_max), remove the prefix from Prefix-set S. Go to Step 13.</t>
          </li>
          <li>
            <t>Apply Prefix-set S as a blocklist on interfaces facing a customer or lateral peer AS.</t>
          </li>
        </ol>
      </section>
      <section anchor="incremental-and-partial-deployment-of-aspas">
        <name>Incremental and Partial 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 may not include all prefixes in the provider cone under incremental and partial deployment of ASPAs. The main advantage of blocklist over allowlist is that, when the blocklist is incomplete, the blocklist will not improperly block legitimate data packets and will still block source-spoofed data packets using source addresses in the blocklist, providing 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>Avoiding improper blocks is more important because discarding legitimate traffic will cause serious traffic interruption. On the basis of avoiding improper blocks, 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 blocks, thus failing to meet the goal. For a blocklist, it will not improperly block legitimate data packets whether the blocklist is complete or not.</t>
        <t>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 should be 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 more challenging. If network operators cannot determine the integrity of the allowlist, the blocklist is recommended to avoid possible improper blocks.</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="implementation-and-operations-recommendations">
        <name>Implementation and Operations 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 would have neither improper blocks nor improper admits.</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 blocks. It is highly recommended to use Loose uRPF and the blocklist together to block more spoofing data packets than solely using Loose uRPF or the blocklist. Loose uRPF is used to block data packets using unallocated or unrouteable source addresses. The blocklist is used to block data packets using source addresses that only belong to the provider cone. Network operators are allowed to manually modify or configure the blocklist according to their local knowledge. For example, to improve the use of blocklist, they can add special purpose prefixes that will not be used as source addresses of data packets, e.g., IANA IPv4 Special-Purpose Address Registry <xref target="IANA"/>.</t>
          </li>
        </ol>
      </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.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA requirements.</t>
    </section>
    <section anchor="acknowledgements">
      <name>Acknowledgements</name>
      <t>The authors would like to thank Ben Maddison, Kotikalapudi Sriram, Nan Geng, Aijun Wang, Shengnan Yue, Siyuan Teng, Igor Lubashev, Job Snijders, and many other members of the SIDROPS and SAVNET working groups for comments and discussion.</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-19" 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"/>
            <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="6" month="January" year="2025"/>
            <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-19"/>
        </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-22" 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"/>
            <author fullname="Kotikalapudi Sriram" initials="K." surname="Sriram">
              <organization>USA National Institute of Standards and Technology</organization>
            </author>
            <date day="23" month="March" year="2025"/>
            <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 AS_PATH verification enhances routing security by adding means to detect and mitigate route leaks and AS_PATH manipulations.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-sidrops-aspa-verification-22"/>
        </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-inter-domain-problem-statement" target="https://datatracker.ietf.org/doc/html/draft-ietf-savnet-inter-domain-problem-statement-09" 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="4" month="July" year="2025"/>
            <abstract>
              <t>This document provides a gap analysis of existing inter-domain source address validation mechanisms, describes the problem space, and defines the requirements for technical improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-savnet-inter-domain-problem-statement-09"/>
        </reference>
        <reference anchor="I-D.ietf-sidrops-bar-sav" target="https://datatracker.ietf.org/doc/html/draft-ietf-sidrops-bar-sav-06" 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="15" month="March" year="2025"/>
            <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-06"/>
        </reference>
        <reference anchor="I-D.qin-sidrops-toa" target="https://datatracker.ietf.org/doc/html/draft-qin-sidrops-toa-00" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.qin-sidrops-toa.xml">
          <front>
            <title>A Profile for Traffic Origin Authorizations (TOAs)</title>
            <author fullname="Lancheng Qin" initials="L." surname="Qin">
              <organization>Zhongguancun Laboratory</organization>
            </author>
            <author fullname="Ben Maddison" initials="B." surname="Maddison">
              <organization>Workonline</organization>
            </author>
            <author fullname="Dan Li" initials="D." surname="Li">
              <organization>Tsinghua University</organization>
            </author>
            <date day="25" month="June" year="2025"/>
            <abstract>
              <t>This document defines a standard profile for Traffic Origin Authorizations (TOAs), a Cryptographic Message Syntax (CMS) protected content type for use with the Resource Public Key Infrastructure (RPKI). A TOA 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 traffic using source IP addresses within the address block.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-qin-sidrops-toa-00"/>
        </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>
        <reference anchor="IANA" target="https://www.iana.org/assignments/iana-ipv4-special-registry/iana-ipv4-special-registry.xhtml">
          <front>
            <title>IANA IPv4 Special-Purpose Address Registry</title>
            <author>
              <organization/>
            </author>
            <date>n.d.</date>
          </front>
        </reference>
      </references>
    </references>
    <?line 275?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1c6XIbR5L+309RK/0YYg1AAkVbMsP2GDxkc4ciMQQ1Xo+t
cBTQRaDMRjfcBylYKz/LPss+2X6ZWX2iAR5WbMyPZYQtoLsqKysr78xCr9fz
UpsGZl8d2GkUGjWOsnhq1ND3Y5Mk6h86sL5ObRR6ejKJzU05cPgPz4+moV5g
sh/rq7QX2F5i/ThaJr0JD+ol+qb3/KUXTZIoMKlJ9r1sCXD0gf7Z96b4/yyK
V/sqSX0vySYLmyRY7XK1BNiT48vXnmeX8b5K4yxJd58///L5rqdjo/fV+dLE
jFmidOirNzrUM7MwYerdRvH1LI6y5b4anxxdnI/G3rVZ4am/z2h7OkvnUbzv
qZ6nlA2TfXXaV3+3Ib7Jfk51OJ2bcOYeRvFMh/Z3Xm1f/XMehbNZhiFZiJGT
CGhgCxhnFtoG++o3GwbTb+lz//fZNNCTvvGz/pQgTW2KvR4Y+6sNZ/Q9ysKU
tn84t6GuIHTUV6e2wOdIh/K1jsllAijzTKu3ob0xcQLgJRZpREcXfpu6QY9A
AlQ5BBlKstj8+wMpElgi57ePpsYpUSOr4DGxoXvyYEyyYPJQRLwwihdY4QYc
q9TF68NXL5/v0ceT3lHfmvSq4HudLHVvGUdXNsjHfrH3anfzWBybvbJTQd+z
4VVjpd1Xuy/dxxdri+qb0KQ9G6Ym7vkRNhjS2pPALHpJCskiaWhdeqJjmp2/
A8MWr9JIu/Vefvn8FY8Yng3pX6WcqqAH6mR0s6fGSzO1OuiNsngZJaXauDAz
m6RMd6WctCn+guMSAPxNlACD1vHMpPtqnqbLZP/Zs9vb276FSPcx4ZmGTpiF
tJvkGT3s2eXNXi9xi8dusS2v+u/n6SLwvH6/73m9Xk/pCR7raep5l3OjlrFd
6HilfEPrqFmkAxVdqUR0oXabuil0odqBGukoC81zE1kfPKPsApSHRlKTIJpe
J2rH9k2/K9/ofQBMUqySGqgyfYUj76jbObhE0bGl+I9G+TY2U1oBS6UrtZMY
oz58eNiBf/zI+vAnx6bvOn11/B5UIPjav4FoGJ/UILYXZKI/d0x/BmSPX496
2cXodWWuAj8CnBpmaRRGiyhL1HiVYCG1Mxx3VLpagneDYKVmJiR1bCCvM6YW
rYA30W2AtRXkATgnCrRj7K/01CQK/2es1BTKPVqAelgtAJQYB7A0+D4c99Xl
HISGqclod0BGB6vfMTmlg4tSPMNJN+ivHFUS0NiEKkt4mbBECFAjObzmyXUB
uLoevQRr46hVaG5rhFOTYt8OfnXzDK6yeTru6RyqhU87AWBzZd8DsHk/DYDh
jQEZJyaAAiNoaSQ7jKMb62M22dO+OgnxBHxrp6YLfFIydSpiSxiBvFPgcBWY
93YSEDdPMZMAZRBNXUFIzrQ8HT2dwjiWq9pYxea3DMzIMsf8hEUz0Blo+Ja5
BpLEorSwvh8Yz3sK5NI48jNmYPXhaWKmxKpx9NHzxnVRSpYRVCSJDbGEIWGj
zS4iIJNAIxKfYXoWkxSkc9h7YEG4Rb5e/SWhlUyM7YMgPOGGzoeOiERC6TTV
4IEbiBJ2esU8Be3SS8CqRh2RRrCTLIUYHJnQiqyPAQREVTtHRxEYW0DIzoHj
NFosohA0BSXxIAR5QOYp6WlFE/LxzFYL0GdGopC0b7oLLMPVndplTTwPDkcv
XrFsklF4x7jh2as9qAhnHiD7Fdmda6A3MSbMmdgnYdqo7uo6YbNy+9fSbZ73
J7Tb/4H+IiUh+qcw7hHxDw3zcykv5k8LadApK78fSH9pP1ryDlmvaOJBwKCJ
BYZd/lrgpphb+S2OMgT/8hHoVKslGNVAnASpOheyWsXK8LCBCnwT4fbaSsxD
4P8oNt36G7XANnIFR49LHbem16BwsOCStAke1vbfV+cYEd/aBAvYq8Ya1u1n
SQEF3qfq1gal/icdyky6zpTqKo4Wdy5OHsH/25v8JEhdlICBZxiluW1g7p0Q
NfPDgFKlA0nmURb4JSMkovAegQDNBTUS2DNzpywUeDZlwblkn0QMikX+1Wwx
nRTsJFEOx2Sw1yxGQJwf0pVe2MBqcIVN54/Qu91SbXZr01sCn3w0RT5bRldD
H5pCO5OxjXjk40fs7+lTRBUVOiBER5w3M7JzxPeKAvxEPXnzdnz5pCv/qrNz
/nxx/Pe3JxfHR/R5/P3w9LT44LkR4+/P354elZ/KmYfnb94cnx3JZDxVtUfe
kzfDH58I8k/OR5cn52fD0yfCLTU1Eht3EkxpyAKpf514MMJTuCPCYTDn//Pf
AzLo/0ZmfjD4EhZPvrwavCTzTvpFVmMNL1/BJitPL5cG5+s071QvbaoDqBeI
EATyNlSktUHIf/+JKPNuX301mS4He9+4B7Th2sOcZrWHTLP1J2uThYgtj1qW
KahZe96gdB3f4Y+17zndKw+/+mtgoT96g1d//cYj5/TSxBD+KIhmK887yXXw
AcnhPqu5igMGHZAFqVMCrJScsmDhqViWNbVBx8yybfyqSfIzPn0bQrozdjNI
ezmnAmcyypXeIZSeoJOYlByB4ZighuRIkEKBhEOnFy4F88Chs18QlV4BaOdw
d9RRoME1wYdvXtuxqFLa2bBqWE8Kw+rc99jcWHP7UWQMyhZGFNA1IWYKryuH
0BNtvOZG1k1Wqeke5RjdEStyQuJKfDqRC0IYJvtq9ThnpBQ150zdx3iIrUhM
uaQzUaVNcq4jc9jd0a8lpKeabEdtfXjUBnbUF9dmux/qrDLBWEN4nSIbHFKV
hQE5HOSgGY4RVBwhlIJQ6GtW+pQ1ekdu+alFIATUiO/0TE4XgEqSxLwS8xHM
Fa8yRyzJ4YobIyxPwsh6Lay4flXXVzydhV4x5bM4JHSYhza5aY+MPjje+OOP
Pzhl1fY3Gvw0HH8OQr3Af4N3m8ftbh33WS//+0ztjHZHz0a7h53q0+aE/8J/
w/EeTf2qV5lMTz+n99tWaH3aivqzn1seefnWWVZGu+wjPmuZLNSp7zjnDjBK
+xwhVQuZRMO1z5GX1eHr+92wV6HkrvtUPnmhGlS8N0SH1c+1Lx7TYvAO9vCX
4/8cnV9cqtoA5d57vP3auMrAnDytpCkHtlKkZR9tr2X3g+bu7zlbEV90iSl2
KoJvoWroyDssSx/21dMrO+uZ95pEW7LMXz8Zhip/As0Q3KFNnHte01tPYLg+
fKiAhv+EWDGj1G8qZvVPriAWeq+vhnEskTaPwZIZqUfYEypw1UAWaRCae/Dd
CFiEUQb959x7OBkG/hv+hbZla0h2dG6XedolN/Fk7nPTT0risNPd4gp0Sd+O
jHtlZMqo0xHLkRgxfVgSSlOsinzv8+HnOEoULBqf8moFcUrhJ6VLrtNtVIZy
5MQgVGf0SbZoKCQK5tqS4ucVKIEGm1nhc0dMotHb0dHw8lgtYHrg8hO6KS0E
WAKQUwCkdgp1UkGUB9IZsbVia9JlZclm3ZnQpD6hZWNMKNpazbAyEYptfo6o
kDmCzGxSppx2sM8gExIHMwhAOl+oodCh+H7QoZWLRFTNV4rIA9zr0V4LH6KZ
fSmIkAfe65uQyCGdZ8mGrMk9vZsqZOKr3X5pFkcv1A7C/alOUjeu064YlCo0
Rrs12jxelNIX9Kk3dGtRBheH8EngF4ts/5PxoxfQwF+8u/d4ltUHwHd/P7eY
uk3j7/QfGuPvdB+2wC//NsPnv1bnYfN+N5n29fFbPIHcEq7Dvxu6G7/VzreM
3+pAfAL4Dte6O7G+mcb4hnexdbwQrepl1MnYCr/ubdyNz31ksja+4oj0jn1Y
gXWBfzD8HQIYGgLTZuKgjkcvWp2UF+1eSjN+uZdX8mKrW7IB5CF0PFnBIxNQ
68dKnUkCEqHN4dFZh/X8EbsaOZ0uDEdGO0fji45KpibUsY36rEZ3bjmcY3Pi
tGkikxDhwS6wr7aJQnVdD4IBZpAi2JzN+bwqwI3PxnsNsssrS6OA/V3C/3y5
NsOMVcrUPzkv1aTMg2wYmSuXnaF1QByVmulcEkWFNdfLZWDlaGo2uYznnXW+
p01mKm0so7j8fRv8T2G2aXHPe4OF2fkBE7XWyw6GFz160ZK+de0jiIcJvpWi
nlRHWzoFCkd06M7XVTmH49Gwc3cumVn5gs//nCOHJpyLc4Ap8s3bM0g1B0st
mAbRhMpW1VKNqxe1L3d5XmC9lqfmhMXESJkYa11lMWVK5MBujEs2SQIjpDxK
tFbeEvFuSn0pr+IyS2OLicVJHw3hXoMMifh3wJBTRlQooZNhV32tQNHdMPGW
00QTSnrGVOri6sUyiFaUZqJqhaJcEfTfIi/JJKCvJCpbYyQ/YgnganRtSQC7
5A80Jz8Wv1pP1CuVpMTxnDfPKQfuPcGq2YKq2F1aJCH+knxaTuD3VGQGeasp
HVYjXIEvspd11pdEEpdoPkXpl/C/0jbgoChPQ/6JuuiJqypA35q8yLWeDxMd
weRu1Bo5E/xdpANmvLKR02V7qREAxqnyXNsF910gNLOwkjWBqdYehUaSkX5M
gbyok7nKaalj47W6ZsJNH3MtMSYfKyGe7HveAKZnQ0NWX7VtiwuybX0Mj82y
cpRZK+l8+FBJpH/8NAXtKnZNrrAMEShHiwUMo+ihZtEx3VCMBoPs9tWbjV0b
ffU2DOy1UacRtftxbFttPslLzrIZoB5wKbsOpNt2FIV4MIuJ8epxxwx2UDsN
sMvmthKmhqiSYINZJc6hDqApfWk0paRz3SjzulldoNRS1q+IGqfFC3Jqf2FT
kbeDAtR3rhBSdEflOu+jazpIXGbIukYqkG4e3TaMVolaUUChFIlrrC60eqHP
G/awXuDnuurfzEqd+EbnzZDVAjyVXLj6RMVMKK2Qq5YM6RNWqMidLXR4pWhC
ZZckiaaWd8DVt6qdqaPqChxka3ITTEfd4gdtk+5wtVVZ3bf+UW+cIMKsZWV4
e3c1YPxQ9pPU+TJy9ZBGQWmrdiq1S4vbWKcD13tK6Dnrr7WtrbVFgIkq7Jpk
YAZdbc0oOeXKxqT+csHPD5ZSbPWDLZiJWdtlD3uj4eX3XDNfyw8mTP6Qd0sL
+TbhLo7NZjdx/kux0jYXMGEfMNnoBMJHyyaJ+S3DxqgKaV1jVGwW5AMWSEiL
SZBEDp08ddow+t/hUITIFA3FxEMpF7p8qFiqaRO+iLHY0dS5jy8gk1aYaod6
JaWvqcVGdbrERdgnAjVuRVcSmc5WxPCcH64z8sMaiqiWWXBx6TzwSeVcxa7N
htJda+25Wk/v3tl8KGqvoo6hlKbGp5w9FDMd3pTiD3kE5TwkWsOPI1PEtn2Z
J/DLncxKaMVUVhDwgiIuHYuDckjNrKaqQMkhFPxAP1ApxCesVIZN4zPSkDTM
Ug22R/P+uTPgYuTuJohZaMGBGP4LCQpL1tD/tXdxcpD0TsJ81Lqvli9LxgtB
6mtoEdbodXiii8/Uztk3gw5jmOf3f8KXXz4MPpIhwoddfOj3++6bzR/bzwa1
F2cf3ynJE7hxzGrEBazyzxh9t7SksI3TH/RyJy8t8MrSmH8XSTm2byNUrWt2
SjbD78LDJH4ep2apXoEwe311ClJb9bU687zP++rITKUxCc9I5HoDjPrC5Q9k
Q0V2IylJIE3LBVq8SR79l4SVHe8pEY3sdifljHx+fecbaS4q003qcJeKVCRE
/is8xUMru6VUwUveBzb7tRp06y/VcUBOZ+XZ55jwSshzDfIQHb4kryynzzWN
vP6Mng+eF8xbYHDdEZ/irNKCRxa9iuV1D3hSryG9rCSNQMyCe2UCmQv2YFYl
E1WAEA4Dd0jl+pSNygJxH0MWqetfFvo9NoM5TfoMdnMaUA+LU9NOOVSBOqNV
2QBX+OoDKnC/JNwAe2yoz5wZVcL60DnZ7NuWe4+coaJdJvWNEvIdluQGfk5j
JG1lzoTXNeJDltpnxMMY8pgwbNEQI5dkIkjV4QjU5waKvMSUFy6GTyrRn1u1
LqGjCopVwHdK7IB4crBXQdUZyery3OkPWkD9F8QoojU3nkIH8CR8PXbATJXq
a0zKZO/mVr8ChaW5RkjE5CWyJHHAWA2XSyiv2kZZW9RcwIdepvHY8hXSiDdc
GJRMD7QY5XlYTJl9IT6edxaxcdGpCy19S54RteTkd4PGa/mNzb7cbWvCqD7G
JYzyHJcgspYvLRNGJUUo4SIHwcqtnmtpXSsLRfHWCeJSXy7xVSOIuPZyz4Tu
G6RUkK55Auxq1uJ7ol5Xtl534huxf/1lkTu+byqAUZeUeFo6+dti6a39a1Wv
XYgmeZWF8a3clCiJNsFhXFm5pMMd2uJAcN9hIIPYNSIMKxd387DPfZWoGI40
fK6ztYZq1vb+jc1zq2XOyChjxf1tTxy1CgrxMRgq3Np/R6HtIxuyIWdvjEnz
yI3TbnAlN10YBCtw6gPPIzj5YVp2/CF80YJBy6UGPm8ZmN+cyl/xnuOMndW+
OneHqhMrRnEDJsKGbekMd0nI8alJAZ1c0JNmRqsZmsoFqkZ+i5V2uNahR9Ss
PuWV++qAbhZszZzlVZxm5txVM1oaOjjwqXUHddoT2DQ+oBtl2D88SQoy41We
Z2mp97SlXrvSdUHZYMdKCzCHKDJwhtimWqBsH6MB8jhwTc0UZKJSQERh+sOO
bf1+Q0MciQEb94Qq13juPb1yv4IokixIhZ+MR673WssTOpnaESVwgvLcJ6yz
JRJERYRsyvg4rPNPQZZc2CSxQ8hdmdtcBWzkirw0yVp0nhdOpGuL4mZL0J3f
IUzmmpI52E2u78iMF1g3TGodEWa3okTjjBQJTHHzsUZAfrKNfqyGpnMiM0fy
7Ie13m8h1ixpnDc4z2JXemm5oFbjyUaSWjLS+XWfttrFU7hIEd1qUeewsXOj
fSjUogAJiQLqqzwmohuiJKdTqZT3nHnTBDsfeXk4fNPpCC7lnSYQJjZN4aja
ExwD3y4gtQxar5uq0LiEq742DI6dBIczESkqqlZiF9k3kDOs5TWS2sJYS5IW
3N2uS+kQTVFJEudSUrlXRGYqP/yKmpFciS4ZZQ2Wm9MElS9RkdhheXq38MSI
lMSbjtqSPCqJ6/pAA1UtfNJpxRFEINAhOJJ5lhOlfByzGZxC9vl4DsPiCFaW
aEiaMxj1ddbvw5UWgV0/FxAMJItAdlB+ToAsahk35MN2XZjIONbmriEnrvdW
f+gilwj57nmvxcV+WJpXEk1OvzcFVzKiFaF1V1zK4+VcaVL3nZ00u9VrumNb
yanRLtG4lleqXNVWxWR1Km6Cc++aPlMYxWslF8mJbdn8w5TWvcppLoO5sapG
BUtAmdvZXDpOm8Aq5bTcrFSLdTNn1CNn/aVGlt+hrzkAXMGiX9spiqkV2FHc
tLGVlzYp2hY2NpVk1OchXTsELAu5+MEqtRlEtNwdvRN8+y3MSp1kQ1J5Q6xA
pygrLnSYcSfDIvIpRo14pmvTrlO7xd2nHQfqOgRPUAdT055HtfYOOs5qOFg1
+L6v3C+TqKX7xZR6NaBw+LYVsAC9SruuEg/3/r/KQoULDOZrlQjRxvkPLbRG
Y/nPMLhLYMWvMkzrg2s17+1XRYvuoYdeJC0viN51mVTKKnnXFh9k5TKmBKZE
rvqOm1e/Kd2DWIRHVkM+nj+cFgzBD4U8kpHLm2i4VM6r6/BaHcBMvKF+qSQK
u+pvUWqvdaCXmW/VOLaxXnTVGbgEFn7WVUP7axaqHzR9HtNPUYV49WMGfhvb
VYbPlzzsZAZWPM0Q1M3NTVf9RzRR49D+6nMZhOjFN68jVh8wQxNuZBEl534a
i0chqjs7vqQbtNwIwT+elbD/KKrKhbkUiWb8+1z5j39MwIP46P0vAT/6jElM
AAA=

-->

</rfc>
