<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.27 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-sidrops-bicone-sav-06" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.28.0 -->
  <front>
    <title abbrev="Bicone SAV">Bicone Source Address Validation</title>
    <seriesInfo name="Internet-Draft" value="draft-li-sidrops-bicone-sav-06"/>
    <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="March" day="31"/>
    <area>Operations and Management</area>
    <workgroup>SIDROPS</workgroup>
    <keyword>SAV</keyword>
    <abstract>
      <?line 66?>

<t>The primary design goal of source address validation (SAV) is avoiding improper blocks (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 (e.g., EFP-uRPF <xref target="RFC8704"/>) 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 based on BGP updates, ROAs, and ASPAs related 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 71?>

<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"/>).</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 based on 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. 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"/>, 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 (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>EFP-uRPF (BCP84 <xref target="RFC8704"/>) generates allowlists by using BGP UPDATE messages related to the corresponding customer cone. However, if a multi-homed AS in customer cone limits propagation of its prefixes, EFP-uRPF may miss these prefixes in the allowlist, resulting in improper blocks. 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.</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 a similar scenario 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>
      <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. Since registering ASPAs and ROAs is optional for network operators, ASPAs and ROAs would be partially deployed for a long time. When some ASes in the customer cone (e.g., AS1 in <xref target="fig-example"/>) do not register ASPAs or ROAs, this kind of solutions will still fail to discover all prefixes belonging to the customer cone, leading to an incomplete allowlist. If the allowlist is incomplete, it will improperly block data packets using legitimate source addresses.</t>
      <t>Overall, 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 of 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, 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 (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>
        <figure anchor="fig-example2">
          <name>An example of the multi-homed prefix</name>
          <artwork><![CDATA[
          P1 (prefix originated)                     
               +---------+                           
               |   AS6   |                           
               +---------+                           
                    |                                
            P1[AS6] |                                
            (P2C)   |   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>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 ROAs and BGP UPDATE messages. Subsequently, it must remove prefixes that also belong to its customer cone. For example, in <xref target="fig-example2"/>, both AS1 and AS6 announce the route for prefix P1. If the blocklist on AS4-AS2 interface contains Prefix P1, it will cause improper blocks. Since an AS may not know if a prefix is belonging to its customer cone (as analyzed in <xref target="sec-review"/>), it should remove all suspicious prefixes. To this end, it can use all BGP UPDATE messages and ROAs to identify prefixes that are belonging to both ASes in the provider cone and ASes not in the provider cone. These prefixes should not be contained in the blocklist to avoid any potential improper block. Finally, it can include the remaining prefixes in the blocklist.</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 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 S1.</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 S2.</t>
          </li>
          <li>
            <t>Form the union of Prefix-set S1 and Prefix-set S2 as Prefix-set S3.</t>
          </li>
          <li>
            <t>For each unique Prefix P in Prefix-set S3, check origin ASNs of Prefix P and its sub prefixes by using all ROAs and in Adj-RIBs-In of all interfaces. If all unique Prefixes in Prefix-set S3 have been processed, go to Step 17.</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 S3. Go to Step 15.</t>
          </li>
          <li>
            <t>Apply Prefix-set S3 as a blocklist on interfaces facing a customer or lateral peer AS.</t>
          </li>
        </ol>
        <t>By following the above procedure, AS4 in <xref target="fig-example"/> and <xref target="fig-example2"/> can generate a blocklist on AS4-AS2 interface. The blocklist contains prefixes that belong only to the provider cone of AS4 and does not contain prefixes P1 and P2. If AS4 uses this blocklist SAV filter on the interface facing AS2, it will not improperly block data packets using source addresses in prefixes P1 and P2. Meanwhile, it can accurately identify and block source-spoofed data packets using source addresses in the blocklist. Therefore, this blocklist SAV filter can address the improper block problems of existing allowlist SAV filters, while maintaining directionality.</t>
      </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="a-challenging-scenario">
      <name>A Challenging Scenario</name>
      <t>The Content Delivery Networks (CDN) and Direct Server Return (DSR) scenario is a challenging scenario for both allowlist-based SAV and blocklist-based SAV. In <xref target="fig-example3"/>, AS6 announces the route for anycast prefix P3. However, although AS1 does not announce the route for prefix P3 or register a ROA for prefix P3, it will send 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. If AS4 applies a blocklist on interface AS4-AS2, the blocklist will contain prefix P3. Therefore, both allowlist and blocklist on interface AS4-AS2 will improperly block data packets using source addresses in prefix P3. One possible solution is that the network operator manually identifies the special purpose prefixes for anycast and DSR, and either removes them from the blocklist or adds them to the allowlist.</t>
      <figure anchor="fig-example3">
        <name>An example of the CDN and DSR scenario</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 for P3)
]]></artwork>
      </figure>
    </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>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 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.</t>
          </li>
        </ol>
        <t>Network operators are allowed to manually modify or configure the allowlist or 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 or remove prefixes that would be used for anycast and DSR. This operation can also be achieved automatically if there is a public prefix list that contains the required prefixes, e.g., IANA IPv4 Special-Purpose Address Registry <xref target="IANA"/>.</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.</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-08" 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="15" month="March" 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-08"/>
        </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="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 314?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+08a3PbRpLf8Svm7A8rXUjalPyKKsmGkuxEt7bEFeXdyyau
FAiMyIlAgMEAkmWf8lvut9wvu37MADMA+JDKW7VXda6yTYLz6O7pd/eg3+8H
hSoSeSAOVZSlUkyyMo+kGMVxLrUWfwsTFYeFytIgnE5zeV0PHP0tiLMoDRcw
Oc7Dy6KfqL5WcZ4tdX9Kg/o6vO4/fRFkU50lspD6ICiXsBx+wP8Oggj+nWX5
7YHQRRzocrpQWsNuF7dLWPbk9cWbIFDL/EAUeamLvadPv366F4S5DA/E2VLm
BJkWYRqLd2EazuRCpkVwk+VXszwrlwdicnJ8fjaeBFfyFp7GBwR2EJbFPMsP
AtEPhFCpPhBvB+KvKoVvjM/bMI3mMp2Zh1k+C1P1iXY7EP+YZ+lsVsKQMoWR
0wzAABRgnFyEKjkQv6s0ib7Hz4NPsygJpwMZl4MIV4pUAbgeSvWbSmf4PSvT
AtE/mqs0dAA6Hoi3qoLnOEz5qw/JhYZV5mUo3qfqWuYaFq+hKDI8uvT7wgx6
ABBAlSMgQ00WZb/fkyKJQnJ+/2BqvEVqlA4cU5WaJ/eGpEym9wUkSLN8ATtc
A8cKcf7m6NXLp8/w40n/eKBkcVnxfaiXYX+ZZ5cqsWNfPHu1t3osHJu6VBGD
H6j0srHT3qu9l+bjfmvT8DqVRV+lhcz7cQYIprj3NJGLvi5AslAaOreehjnO
Ngu//PrpKxo2Oh3h/0IYnYAPxMn4+pmYLGWkwqQ/LvNlpmv9cC5nShdEYCGM
WAn6AufCC9A3lnZaOsxnsjgQ86JY6oMnT25ubgYKZHcAE56EIPyzFMHWT/Bh
Xy2vn/W12Tw3m635afBxXiySIBgMBkHQ7/dFOIXHYVQEwcVcimWuFmF+K2KJ
+4hZFiYiuxSalV5okLqulJ7YAX2xKxSomOtMxcAcQi2AxKB6xDTJoistdtRA
Dnr8DX9PAJICdikk6KzwEs52V9zMgR0Enk8Bf3FUrHIZ4Q6wVXHbE9IgktwC
w4tlmBfwBcBcJtktkkPoSKZhrjLYUEspPn++Hxfc3ZGS/Nnw7ofdgXj9ESiG
sITxNciLjFE3AimSkpXqjhzMALHXb8b98nz8xpkritslsCwCO5MpamEJUM+I
drgG/JLdJLC6ADEAqLQAShJ8l2EktYB/aV8RgU7PFkDLLBcJrJIDzksJ30eT
gbiYA9nBwpSEP5x4cvsJJhd4jFkBz5BC/mkIg7cGistUlJq2SWuAYNWMj7J5
jj1Y2N0PfwRGh4MXqbzxSCOmFd5mfRd5Ws5BXkxDDbSFaYc/jIUxfz1xfjaC
f/FMRpPxSItcIgFi0NqMYZ5dqxhmoxkdiBPgCeRiFckewFOghRMZGcAMyBsB
DJeJ/KimCfJ2BDNxoRIENXQAAiq7xBBhFIFNRBx4V5UDGL+XwJokgQQdbFoC
nQGMWBFfgFyRYC1UHCcyCB4DcEWexSWxs/j8WMsImTHP7oJg4guWXmagGVGI
kCUkih4iu8gAGA2KMCthjIzKHGQCfgEzD1AgbFkc3v5J404yB/SBIDThGs8H
jwiZXoRFEQIPXINgAaaXxFOga/oaWFWKY9QPaloikY9lqljyJ7AIEFXsHB9n
k12zBGMOMEbZYpGlQNMSjxC2yCWQOUL1LHCCHU9stQD6zFAUdDfSPYAyvd2o
a1oCeHg03n9F0oe24APBBs9ePQMlYKwCSLcjnfMQwJtKmVomjlGYVio/X+pX
q7r/u5ouCP61dR0qFNZVlf3P0qZGqOZHleSEBSnKv6OuC+NsSRiSDrIqBydW
EPboawWbIM6mX+HYU+B1Oq6wCOFUoisJosdA+RxLKhh2BiccQAH3hSXD24n4
DWQly2XP/0UsAA1EoSCJTYAGME59hFWnMgHfrdZGMCqHDZeoeeChh/9AnMGI
/EZp2EBdNvZQBp8lxhzweyFuVFLbCsCaGbrNwOIyzxYbN0df4v9tkz0JVC31
wnqelUlcn7Bmrbf6lL3VcDygpsGQyY2MXW3aZGzjmX0Rnq42+Vczwkh2MJBI
OeANCbiWOQTAdEpTCXpnoRIV5sD6xfwBSrRX68CeN70j0LGjMdL5wIyzaoYb
7tzdARqPH0MM4aALkTeEbzPJCELYLjBu1+LRu/eTi0c9/l+cntHn89d/fX9y
/voYP09+HL19W30IzIjJj2fv3x7Xn+qZR2fv3r0+PebJ8FR4j4JH70Y/PWJc
Hp2NL07OTkdvHzFTeKKfS0NwIiiwOQpKqAMwshG4G8xIYK7/57+HaLD/Dc34
cPg1WCn+8mr4Es036gTejbQyfwVuuA3C5VLCMRptGYVLVYQJiqdGWbtJBWpa
IOS//4yU+XAgvplGy+Gz78wDRNh7aGnmPSSatZ+0JjMROx51bFNR03veoLQP
7+gn77ulu/Pwmz8nCtREf/jqz98F6HxeyBxkPEuy2W0QnFi9eYjidkCqyXGw
QNTLpDCyTrrH6ASSEccatLQDHjOJsIxdMxKXdPoqBSEuyTVAJWUcATiTsdVt
R6DbGBwtCzTeowmumqLxR70BghzNazeAeODI2Jx+kfWrhXaO9sa7AmhwheuD
7+1hzBoTMRu5xvCkMobGPc/ltZI3dyxjoFPB8MHqIQImK0/JrtBnpdtyE30z
Uyu0BzkzG2JBSj9csh/GcoEAg5m9XGda1tjwWtSMA7SNjWCToGW9pbFEtekx
7h5x2OboViHQUYgmwtsfPGYJMUbM7sh639EYXFyjBXCbIiucSFGmCToJ6FRJ
igFEnkGoBEIRXpFuxxzRB3KlrY+8w0GI4ypbB1nX3KBrdkAX4/34eHTxWixg
L9DxLc9ircf3Y3YjwXyQvwcRH0iy6s/hd/RS8Gh83BIF8ZgmVymcMQ8CuvyI
D89x9xfhrcDEc/N4m35tz6gQ5u6mmwZsypGO2B/s424VaSAkA3mBE02FLkHQ
QV7kxxBFEocRqIBGA9YKihs6FB/lCtmRCUIBcNDBv77+z/HZ+QXS0/OtwzTN
Sop74BckD/i7qVZF5X3hyf7xxx+Uoev6Mx7+PJo8h9324e/ww+pxe2vHfdW3
f74SO+O98ZPx3tGu+7Q54b/g72jyDKd+03cm49Pn+Pu6HTqfdoL+5JeOR4FF
nZTFeE+kWSGedExm6vgY28MEknfPYVJ1kIlVfPcc/tEd3sZ3Ba5MyT3zqX6y
LxpU3HpFA9Uv3peAaDH84DCjN0CY3wNC3xvnDLTk6SRNPbCTIh14dP3M2A+b
2G85WyBf9JApdmpjkCvQtXjkuyRLnw/E40s161tRp6T6t49G9xJ+o4I85fYI
LPfnz87S4EBCgFtippu0r9CwagJeo82lPHQndlWeDcQozzlNQGNg6xLtBOhp
LOB5S1b5HpyLOt/qHhPOgD6ToJrgf1BdpP/RoZirpc0vWV8H/R7rA6GyONrt
rfGJemgbx9L8JHnKeHeXTaiWbFJgS1CAbF75+4CYwMLIITybPkwgVsSplQD6
e+hD3mR16IreHNglAh9ljEPnfTAIEINK3qGtpA0x23YRwS1wI1iLF6T8Baqf
Sq04gNJAPCMy22SgeqQ0yb8xvoT2J3QgRoRC1DwPg4hQofkcomDiCPQ3dG1A
dwDPpGQSJzMQhGK+ECOmQ/X9cBd3rrJontOYoSv8rI+4Vs5UM3VUEcEmF9pI
cAhVzEu9IuWzpZvnrox8tQfO9rssl0RNOJvO7OHh6LyPP3TEvqbedne3i/so
TodyXlmMyiJLswXmvie3GuLvSgLwpzkQ75PJD2M2ZndzME40OKeTPiOV1Fzn
/AyWqQL29b65d2JiQTTIppjEcxJXzOZcg4MAnwQLE0cEyNmIHF3M4iDWJFet
7EmvOeOGvNqptBliyqlgjhi9YsyhCHRtQacubKJIA9AcV3VqMnNIKIvwe0N9
7kJET6xlcTDgwEacDKOo/0ph0HDpnDwxGcRL8O9lqBKkVqw0pZA2JTdd4Hro
Z9scEOXsqoDNofLJQ/OcHUy/JtgFVj+7RgWQ9BA4jZzIMQ066LjZRyzPoDft
5JBItVCVo4ogfSG5mSvwfCkb9iVS5uiyW5JXoaBHclNcWhtTnJh8ThRqabOI
bdIzWams0nT5MQb/IQsT2q7ujDFxNpZYwFY7z0O1oIoW2AIF0YwnUG6mlinD
uYCHlBOqRKTJM9eKNm9lgTWV0zBEQaNGh4mA64MgGIJVWVH4HogutCh93VUh
emh8S2bNS6Z9/uykMO6+TPrfha7JFYpWBJCzBbgwMSvKZla3WJG6BwbZG4h3
K+thA/E+TdSVFG8zbKsgY+qW9VhqLDIAekKJ/2ZRreMoKqEgFmMh71MtEjDw
TgPYZXXBjqjBFiBpGmRTREDOwdpqhF/82ZhfaOTRzawegNRRBHFEjRISFTnD
GON5krfDaqkfTAqqqjtbU3VnSjTauKLKlKiBdPPspmHUatC8XMXDyiGU0f6L
vBUnsQxt04lb4cBkF+X9MI0MqiqlfDGt9AVzg5hxrDS3k67ChJfWWaQIA8p7
uibTB9WkltAugiGmGjgedYe/tE6609u1ymrbzJNfZkLCtNxAQm99gcn4CkxK
ny+BTcK0ncpbq51q7dJhaX06UKatXt2yfqshoFV3aiZmwCU1MacbcXaGqNsl
RzbN4kj5hagzB/+8vaoN1/7xZlFC4cWHe86igNLs1UhubYbwF0w8NFJd62dt
THx1ztqY/dq41+qn2+fBOvC6X05MPCgpJu6ZFfMh7MR5NVdunSlbOethexkc
fln1xZm1ZWKtOWu7NFtjlvtlZdKtBWEH1Ju1wIbc3D1m3XOvdfk70ZXA2+vO
4FEHm5Oa5/UwR3fhuBmc93d7FmoLf6lydFutw2YNsqlfOAa5cgLqYHk06Y9H
Fz9SlbldYCGzmZKVwo2q2HRlXKpNCF3tRME4tZx1rT4pp1r+XgLgWJdTpr0n
lwvYpd6EeysSnZntbA6tEYy9Aftq6Nprxeh76OpPM/JXhgbzF1XerjNtBydc
Bc2emW9lmqwrocXYzqwtO9fn2rUeynnwIWIwiorwKgXnkspTBgLVoHALa7GD
/YvcP9QR3ewSGMYPM2TFIFeXeqki6pe0VKb2IQpbIEipTtzE253FtyrX4kYL
jUPDureLgDmBVR4jnwv8itToGkEM6ZbYfB/TnENH+00dYVE70YomK2AilXKR
2BCAE5OGQfAOQOp5xO0uH3LgncAC3OtIxpjuhhAD2T3CTBs/AhkfgRMPICcY
VFGUurS57xr0Wb1aNZVcXYjnMyo/c6h9hA2v0g0F8Og4ogLPFoiTwifYqU4Q
Tk7R18dhCuu4fZz3j50hNT3urVqxTBXILAz/FVUHEWEU/9Y/PznU/ZPUjmpn
Hey2GIbtG3nF2MRfj6OKU7Fz+t1wlyC0qXGwNKe/fh7eYRYOPuzBh8FgYL4p
+1h9NfR+OL37YEqgZhySjlI1xIqnBL7ZmrO/0mhU/HHHZuVpZ27l30RS0hpd
hPI6ayOMfkDSZtifLCaFXIpXQJhnA/EWSK3Et+I0CJ4PxLGMuLkJnqGk9Ycw
6oVJpDNCocnPSl2TgBubK7AISRr9J03qn3DSHFsY7LgSYOf7mK+kOYusmbRL
Em9kJuZNK56ioQ62+4DHS8IDkP1WDHv+j+J1gukT59lzmPCKyXMF5EE6fI35
BUufKxx59RU+Hz6tmLeC4GqXo+NTRzkZPVOP6QOc05J/rMhKcWvFvTyB0ruX
pE0qJnIWQRiG5pDq/YF70jLhREhKInX16yL8CMjAnCZ9hnuWBtgHQ3wJDMXK
wV3UmHEHASqO+QOcdb9G2Paw2wB70YlROcmemnQRZWlq3DNTBEAstY8oAr9L
ktyAz2gM3VUh1LSvZONRax82nbTyhI4QWOB9FWeTcX6AqumJiNkgtBqsw19D
d6XzIA1+XSBiSWf4rAt3DxGOc9x5zEv1AxSD4fO2OrSuBELkjQeU5jK6cs5F
19uKMV8+ANKDtXEcNSeVWztlm8jZ1GRj5yg9mDaqtuFLRPOFg6bNQWyAvErQ
mvGYLQThTWRIzph02bMlzXR+Pev5OKuQ2vNPQfzgQIuqBkAWo+US1LyPKilW
zyG8792kIDi8Nabb8nc4ZZfXmHcuwLYLTaY51ndsyVHpTEh2OautVJj1XX3X
zbjalBPrbLXm0j4BFGfGZVtdWfULv+Rn1iDUFYuVHXFUylZOEfdLlGYtaO9k
mNLNk8rtsw2ZidMoiKN5q3XZ8LW9f66j6F1xWEUOgsVk9oguK+4EdHZeut2k
vY1Xa/Bi1uPHtTkFfiX6mBs2x/UNGzp5sH9BcJqRd4iZSapyxApvQUAwyzXW
1DRMeAW21eHpTWcZ1h/TWWdt3RexwhA7VLVBlvXovWJf515lyp6TT5COK0eW
ICxafJkMLwoV2IzhufK2sluXmpB6PUbdD1gaZSj/x9VisKpmhqA75eYvxsg9
QzQu8S1krPiKU020KRzGpeKbeHQbgyOAx2IkjuZAC8nR4cT0GnHR4wg0CZL2
WCZ4Nf1WnHLJX4udo+NT9mmOiX/pDh5Q9VwWZZ6KnePJ+W7duET+euRsU/2C
HErhaFenciXr/nOqZnnqd/+OXOM6ldBsAQK/IkJTZXMK+04napiAk1XOOCdR
KdENSYl9tCgV/4dozP3faz2JbUv304u4vOlKx92BlqKQ0Zwb5CsdHoJVVFxk
8lpwaq1trM6WLThElebaK0ysv3RDIjqWdTSDf9r+GXfu8SWagAiIs1RW95Lq
u1bKuUrQ7GjBa08l33Jk5akMZ5nrj2JpbtJXKsxlNpKOyTlHZ1Jhccw4QbTI
or6n5l8simPzuzn/unukriIBh+z4TN1dPHLzpdsVc+rxTsmoPzJ7GTH/IutX
m6z/w+PH+1sWiMx4tzS0zXjz55eO4sSq8duVg5r03FQI2kTP1evTn43Fn+b4
NoKNR2b8mtqNX0gIvN82rW7Gb1944fHbl3cetr6BdYuSjoevX8xZO56J5pZx
OusxzfNyCzib4dlGJr3xTtGm/zoGx6kt8PdefwcXTCU5XSvs83i/s9t6f3Wx
BvwPq2ArbwLLNXSbKmGvh/Q7DnLeMmRbKsxX7jjJlhqmnrZug1L+Kb5WmhtF
nH4saRX6iqaszngUHXOwg+naW0VodR94mxQCh3dSFjaapZa2IFjV+4WWj9qK
4HmWF+Ao1/eYlI5ChqDjerVTULHve7A/Ec55SelzNLhs3UKtOE23AhL2Irpa
hcyrDYybIYuCL7m0miibbR/82odG7xhlR9KsGb4hNd2ntPNAHJbFhq4066PN
VRxLJ6Y1Taod3dldPaudfa44PsH3YAD+qcRMDr7zgcKbTm+uq62xxy3U2F9p
WGkBzMGRGXAGJ4G8YubayH5VSANBEwlCK26qyIStwlnBt52tF9ii7NoTbN/T
bkgm8qLvKrnvFth6upMYQOLoBYanJ5OxuVwa8hM8JO+0tPpUtRhKYHakRoYl
JbrWKisSeZ66SyErd9w/hcBdyhurDVYyiFWh5PrObas138a4Rqhw9UZFlm5d
Uj5DX21oQK2gbqQLfECI86qmbhOAo+xUr27xCEhP1tGPNJITKlJI0nlPH7m0
prHNV81y09fcuPPXYs9GLyiXJavwoKNF+LGYwNaYTMDO6rkMY9Ct1T0AEC4A
/dYWbPAVNyiyEUfQfROThLi2HXlxNHq3u8uwkHYnQIAwuWwKh2ta4Bjo+jRq
aKB122ql0vQ1hleSlqMEiIEZiZRVLeFsIinvwWfopa60tzHsxRVVqsyGtXSw
0nBSn1ZK/CivOnxH43A6LKwZpbWWmdNcym7hSOyoPr2bkNKlGnnTUFtpn7im
7pAIS1NuM8cWUxCBJMR+fuJZzr3iccxmEPBTPotfkoFrUfaet2j2Plx27NNO
89bGgdJatnOBUyZoEvntaGhc61y9HbZnalgEoze3BRynFde6RudWIvh7ELzh
9OH9uim5Cm4sdCugpgYWR2hN4F0fL7W26M5LAGb3xqWL1Z3djbyIn9F2VK7o
uixA6pQ9BuPpNd2nNMtbnc1csF+D/P2U1lZd6yZJvbJ5He8FwCpzNZvzTbLm
Yk7XujUrbsfGzNj3zDgC3IpuXwLm+QLUKI5vCa3uLDhrZ3nTxjo/Ks2tydUu
HemdEptCsogkEBYrU4ofQs7mNK6/NMor2yzf/TYZpx15Va/4irgBj5G3rLJI
iyzGBHxGU839y5am9+nfEQsgDRJqU0okhGhNC29cWVNqwwN2k9+uCxDHqxNZ
hHzlDa7rHIfVPWpmeXfvWHUZjFbqSJSZ9ylkViMxkNxxZu/axFgTz/B9FPw6
L9aytul8WU6TWlEy/9JLHKza5QYiY2zr4iY77Nu/KBOv78FgevcNRJwT+7a7
zuDSvgvPvKmjejVe5A/2rsesf21PdRHxn/dSH6a7TQMXpinNvjGH31qC5PIx
br5TC8vEEFrRSDeC5cJDVLEwPWTycMuDvTpIt2po9zC9Eodg6t7h1UudpT3x
l6xQV2ESLstYiUmu8nDRE6fAMuClzHpipH4rU/H3ED9P8DXAKfz0UwkSMlG3
JXy+oGEnM2DEtyXEqHN53RP/kU3FJFW/cdcC0ovefJWRCgRTOqWbbqyozWuJ
aRQEqaevL/A1R3Rnil5czNlgVrcmasfAuqR3I9s3ME5BauBj8L8L86XZxVkA
AA==

-->

</rfc>
