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

<t>The primary design goal of source address validation (SAV) is avoiding improper block (i.e., blocking legitimate traffic) while maintaining directionality, especially in partial deployment scenarios (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>). Existing advanced SAV solutions typically generate ingress SAV allowlist filters by using information related to customer cone. This document analyzes potential improper block problems of solely using allowlist filters. To minimize improper block, this document proposes Bicone SAV, which enhances the SAV technology by additionally using blocklist filters generated based on information related to provider cone.</t>
    </abstract>
  </front>
  <middle>
    <?line 65?>

<section anchor="sec-intro">
      <name>Introduction</name>
      <t>Source address spoofing is one of the most serious security threats to today's Internet. It serves as a main attack vector for large-scale Distributed Denial of Service (DDoS) attacks and is commonly used in reflective DDoS attacks. To mitigate source address spoofing, many source address validation (SAV) solutions (e.g., BCP38 <xref target="RFC2827"/> and BCP84 <xref target="RFC3704"/> <xref target="RFC8704"/>) have been proposed. The primary design goal of SAV solutions is avoiding improper block (i.e., blocking legitimate traffic) while maintaining directionality, especially in partial deployment scenarios (see <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/> and <xref target="RFC8704"/>). However, previous SAV solutions cannot meet the design goal due to technical limitations (see <xref target="I-D.ietf-savnet-intra-domain-problem-statement"/> and <xref target="I-D.ietf-savnet-inter-domain-problem-statement"/>).</t>
      <t>Existing advanced SAV solutions (e.g., EFP-uRPF <xref target="RFC8704"/>) typically generate ingress SAV allowlist filters on interfaces facing a customer or lateral peer AS by using information related to customer cone. The allowlist contains prefixes belonging to the customer's or lateral peer AS's customer cone. When adopting SAV based on the allowlist, the interface only allows data packets with source addresses that are covered in the allowlist.</t>
      <t>However, using an allowlist may cause legitimate traffic to be blocked if the allowlist fails to cover all prefixes in the customer cone. This document analyzes potential improper block problems of using allowlist filters, and proposes Bicone SAV to minimize improper block. Bicone SAV focuses on generating and applying robust ingress SAV filters at an interface facing a customer or lateral peer AS. It allows network operators to use either an allowlist filter or a blocklist filter at an interface. The blocklist filter is generated by identifying prefixes in the provider cone. When adopting SAV based on the blocklist, the interface blocks data packets with source addresses that are covered in the blocklist.</t>
      <t>The reader is encouraged to be familiar with <xref target="RFC8704"/>, <xref target="I-D.ietf-sidrops-aspa-profile"/>, <xref target="RFC6482"/>, and <xref target="I-D.ietf-sidrops-aspa-verification"/>.</t>
      <section anchor="requirements-language">
        <name>Requirements Language</name>
        <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
        <?line -18?>

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



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA91b63LbRpb+j6fotX9E3JCMScljWZVkQl2cqEaWOKI8uzMZ
V6oJNMkegQCDBiQzXuVZ9ln2yfY7pxtXgpSUzNRWrcuWSaAv5375utXr9bxU
p6E6EsfajyMlJnGW+EqMgiBRxoi/yFAHMtVx5MnpNFF35cDRX7wg9iO5xOQg
kbO0F+qe0UESr0xvyoN6Rt71Xg29eGriUKXKHHnZCsvRB/rvyPPxcx4n6yNh
0sAz2XSpjcFuN+sVlj0/u3nneXqVHIk0yUw6fPXqLZaTiZJH4mqlEqbMCBkF
4r2M5FwtVZR693FyO0/ibHUkJuen11fjiXer1ngaHDHZnszSRZwceaLnCaEj
cyRO++JC44tl51RG9muczGWkf+FtjsSN0dF8kUnxIdJ3KjE6XWOMWkodgsCY
JBV9l7pBfRVkfT/CAB/jIDal/4E39D3OopRYPlnoSFaIuOiLP+uooOJCRv5C
RXP3sE7L3xZxNJ9nGJKBVjmNIQvIsaTnZx2F/nf0uf/L3A/l9LcRdAIKSop0
/v2ZxISaOPnu9xByobMKHVMduSfPpiQLp88lxIviZIkd7mCxQly/Ozl88+qA
Pp73TvtapbPC7qVZyd4qiWc6zMf+4eBwuH0s7EjPtG/J93Q0a+w0PBy+cR/3
NzaVd5FKexqkyl4Qg8GI9p6GatkzKTyLvGHLDJU8cUbu0DKh2Y6UN29fHR55
Xr/f97xeryfk1IAGP/W8m4USq0QvZbIWgTJ6Hol5LEMRz4SxoUW60HJXhBax
B6/sCA1Hvot1ABUIvQRZcHAxDWP/Vuzpvup37Rd6Haq5TrFJqhAY5AwC7Ij7
BWQuiKUU/2hUoBPl0wbYKV13hTIr5WsZhmtYlVjJJMUXULkK4zUxLoyvIpno
2Ig9o5T4/Pl5gnt44Ej0ozOQj52+OPukTUq0yOAORqkCCkCQRJjZyJWuV1A+
UTRXEcUzBdLmLB8aiDfxfYglBAwKWxsxXYvMsIRyU4H8EhViZoAYJHyEyXgJ
wVH87YubBaSKMJ0xfwiR4foXZcQqTvGduG8I2vFkrL5CFebbbVCCtWOxhKCX
+hfVWKYr0tq+9C422LfMHV3Sl78QKlqQXCCJBT8XqfIXURzG8zXxCmPRVoMF
JbxDTSa56AIxlQY/IZEt0gEhdzrIpWNtd6mDIFSe91Kcw5HiIGOTEZ9fGuWz
b8UPnjep265ZxXBx0gIkBYYgLaJ/GYMqA4+OM4xRfpbA7vAG+So1tH8aB3L9
haGdVAKD6otznnAHAUj8ZfMVMk0ldHEH440TAUZEKJM5siksRYlTsJ7oaUYs
napIW+eaYBENCvdOT+NJxy1hMyNo9OPlMo5YhJilSSazkHzjDuthQj7eKTXV
c7JE0850F1RG60fduTTyPdWfw3uPT8b7h+wdFNQ+Mm14dngAR3PhDR5Ueo9Y
SJA3VSrKDSggg94aX+qe9f8xmvwQ3yskjC4koO7YyOo8+zKK4lQslUrZHqsC
CjLFFkjuRSEHmRCKdgXUdgJ3ZBZH4PP56sDzHguMzmbO3o172fX4XdUsnh0z
OR7g00xSoMFP3rcMlexgeA+hrBS+jybPD7Oqsi+ekdEYUtNMf8KeUxWiLqH1
SAUYnM9HLNjcHQ8b6/8HqidIKl6xyIjLItKl1a27/LVgVrDP81tEY5lKmKl/
qxCL7nW6aHgwx2CJJJGAvBhmZiNFbX0orrBBlxeiCuNLuYYNIsa0uBRxPlXW
6WjlWX1lqEWHHCN5b3pRis+R8U/MbVuSWpctuiVdEWFbkl2/OmwGcmgmFOOM
0wopEHK1Ctf0BVSAj5rJ5oZK0q/Y6pNMlVOIUzGcj3ofEXNrFCcsT1KHgrpJ
qNEGy7Si3MipTUqshW+M0rXcizgYkORnzGZTefXU+5hFF1s1LZpf/C5jLpbu
22oVyTmwvKgIdX+CLjJwxjqTSx1qmdgdihDUrcW8lsr/4aHLo6n0/9jdiJLb
6v+HB5D08qW4Vj9nSDZk1oa6QPQzc2WJRR8rqJE14sX7D5ObF137v7i84s/X
Z3/+cH59dkqfJz+MLi6KD54bMfnh6sPFafmpnHly9f792eWpnYynovbIe/F+
9NcXlpcXV+Ob86vL0cULK9OaGybKCY91Bisg25DGQy7yUbZYPSDt/89/Dyjx
/xuVA4PBWyQT++Vw8IbKgHvYh92NY5j9CvWtPTiSgko02zLCzQpZLCTPRYWy
iO8jAUun2u7ffyTJfDwSX0/91eDgW/eAGK49zGVWe8gy23yyMdkKseVRyzaF
NGvPG5Ku0zv6a+17LvfKw6//GGrEnt7g8I/felTE3qgEgYoLaM87zyPVMRn9
EXtxpVCDp2Rh6lyFnbTqUZUYvuFcpOYilLtNoCZXZKBn9lH80sxKeINOxnkQ
OEEQOOItDWoVBOTRhFaNKPeiiiGnRHNQZGG2gTwI9tK4V0QTcH9LK6N6r/Eq
xpVoP7GdzAdea4RNiiBoq3yqptT9g3UxxCFkKywuaap6pE4pQ+BGNnyshpDV
KmCvEdm/MJ1mvptQvTmzpY/1hSLg1qLt89YtfQw6U6v0SbG1Wc8YVVLgIvhG
FmMjK7Zu0tVx+VzT4raGqNGB2luhWwnELImXuzIiYkAWBpz1dpO9rbrYLMma
9ZjIopBSN+VUxY0Gkjr6MXiMvOXAT/jIx75AmZvXr3u206mUsXnmNKXJVNr7
4+/H4sP4dHRzhnLeGCQAU7WdlnKoKMxQWqGRhGPr3gLvA/KptgrKdgAmz84r
ObcmCqunx7l8KkU41XcE0DZV3iwTuy6yWOPfqJcmto8S+/192qyQCRo+eBO0
HAmTwf3hTeqTXK5CbrCZWhU0SS2IuGdt1Dkv+B25Fhd0IzL/dPaf46vrG3bC
ap1J7VPGTo43JCHUrpHRaVG89JGkZnrec2QhT+kwzAj7Yj0KAxrRqxet31Po
blUNR8QDiEpHhMZPBlvIZ7szjBGMB+zK42GdjdFk2N0yDOKidjEnrKy+MKeH
7av137FzSnockZ3lHmnaF2c3JTOqqACETGOEk8KeRuE8ThBglmLE88rvx1SB
0l73ELCr3yv5qD00xJQ+DkD5sBJ92gMYhA5aieIhksevv/7qiS1/xoMfR5PX
WHif1PBx+7jhznFf9vI/X4q98XD81clw3Kk+bU74L/wjAWDq173KZHr6mt7v
2qH1aSvpX/295ZGXs55rk8zkq5bJVjp1jivm1D7HiqpFTHssk/Y59mV1+Ca/
W3i1khy6T+WTfdGQ4pNXdFT9vfbFY1kMPlYctDZAuPces18bVxmYi6dVNOXA
Vom08NH22nI/aHL/xNmC7KJLRrFXpvxEI6uSyjvsS5+PxMtKmBR8xPjNi9Gz
4nlbXHzBUOySkNZEseOj5WgFjo5H1z160dJ3uaOMh4dOE15GeMvSOIqXDK2t
TaqWoihZR3xo6E6axN5oMh51Hm8E2YOuuTq4Yik117m+wjJFs0gRu0C1pGPT
AgYlCFOmesPpIUFgBK0JV7cgy8K+WJjLKWqxiUMO0BsIQbc5wwZclQOaVNQz
pEmlF2MFVEJBo8u8iTekj8YilFr4JJfQ4hzZz3Vkt0BVjZ+E+hDPgTbtuI98
Rl3WpQIscOVdo+jwvKs7mhh2aaghjdqilPABMslPBNVT6VMBLzm1MQ9FG1A3
NnuGURyUqE04LGewqNR3MviELuDcddy+NMrKtoRg6lvbGqytANt1clMBs0w2
R9mZ7sCVNs9ickAgr4C4Nfs+RodOwq3cHfAqG0m95CWxPHVKNbPfxMm40Uof
hXRlvS9AZT0jLU9bjrTIbjdYYWCNKlLwbs9lCEc3R5436ItR+9FCDQvMuSqO
IZ5YxrR0OHVeQNmsDX5twodkBHyGsgUIrSkb28fLpYoCky9dEQnDA9SdFQWh
5w374v3W4xEXG1pXehzirLNbRhAHOxJAYDmpCdBu9miv2opEPkGa/3pKqcp6
xknBxjEB4z/fl2hEDemw4Md5BYq4LtvJk3wdwmUqhzM7z2SKJNuxfCp7uljL
YBtnMc923H6TKYvvPM5TDWtyQE9O2APjrH9Sa3EeKJnfWqiYBQUri0YRuIlo
HTGK+c9DrIiqIguVDagxsa+ZA+5beI82AD2HOazJWMETANrS5+wKMtF619HC
k3GO+uGAI82dgu04BGuext/Uap/KEYCV8kwnlA9sItVYMJeORSuq0inUUNYl
o0lvPLr5gdHnTWyFeYi6WKooRXYc33EfbPeu78vH7ZEfZgEfQMQtIEl5/CBO
t2sm18qG029D5Jqr51ooj9wg4MuYzuMIh9Oz0nTJhmrlyXarIxg+l2nSViM2
K5KSHi76eCsrn9YTvkZo3lXrlCuT99lq0oba4nJGfvK4TbSkrd8iWzYWUI4q
pZZCHfWYgEQaaHsw7duDHElFdQRu7UUQJQku5/Mvi4y/LIMcwhhil6+CLEEs
HkG28KMQ5NsjlFXeKZUSmJczV/lM9ldCZfho0FYtJ3QRRVWDGCnBZm4KV3EU
4RN2KpueySXFKhqmCZDp0by/7Q06BG4Ot62YRfrnjHzkJ3I5FuAo+Efv+vzY
9M6jfNRmHsi3JYHs98U72D5H1fp6VkuXYu/y20GHKYTf8o0O9M2XP30ePFBT
gw9DfOj3++6bzh/rLwe1F5cPHx146MaR6BjC5gh8yeS7rclk6JWNRfTSXSZx
O9tbbI+JlAu4NkHVbrz4ZH3wqDndGxKTVK3EIQRz0BcXELUW34hLz3uNMKKc
jeEZdRq9AUb9gffIGZKu5+Sg6URgLxwVZDGTPPoLwy7OPBnrM447iyfm8+uc
b5W5Db5uUofjhgsBgd20sCkeWuF2H3y8YT7A7Ddi0K2/FGchhYXKs9eYcGjF
cwvxkBzeUhTJ5XNLI2+/pOeDV4XxFhTcdmxev6wcHtuIVRnTA53TzL4sxMrJ
t7BeO4GCJFcR69KIKosQDQOnpHJ/WE+UUZOacmtNjPy0lJ/ADOY05TMY5jLg
ronsEgZlg0N1UZf+KgxIszGgsu5bom1IOD3dEWNDtWBC5BpeBvtL3mMHbBCX
ps4oEd9hT27Q5yKGaYN8DO+rLJZQRp8xD+OVx6xCmICtAGmSQ6GfHWq6wrdm
IPMI1gJr8VXENkU6/tpIJGB5cNDGe40RC7HW5okR3RWxqc9OohfsrmXMx9P2
9uSkUtBduOw2doX0S0EoSChX4hgtPcWZepVMtDR6gXOH8FRus9k2gFg6Ob3k
OaeT6/LMo3bS/xtvve2E7RBTnJK4xWVsxp4stBYtfPvmOX1UNb3XLynVgYKy
GCFkzEJJCWqGVRxZbKByCEHVCVGYV8WsXMsE4zEMEjQb9fuyNW25FFMSsiSg
BDEOZWtpvUUIk6GJ833b73S9FJNsyVcqYZ3XORDg7gbazqmAXtA6UV5+3j0l
W36cW7dvoklQ4i3oNVS0bMOzXEX++9BBOKg2JdBh28QN1M617vkp9MYLgoQY
oKJruH7aAD5I7NEGmOSqpW0CyO9tQg7/p2LYvOGVtltm3xqBQ/O71tFrB6Ot
2yzcoV5m3IXvtntnG0d4OczNMdQUl603FUMl3GOYl8u4B9w1qMhJ211/catv
rFxQ9brp06Q2ayebN+BVtEPUT9miPHXly7x1O2ujk3BXNkrSXLsd5i3VvVx3
LUqZFuLYEoN2X4S2ZfoOkAEs1XaqnOj+JlBsNBlQdbmfV5avn0DB8PdQsBu3
yI/qOYrmV/5zcKcWQvNfCHD3jIrfD/Drg2vpc/edwyIl/utuJNrsQZdXCXFh
AVSu+1EBRgGpBBvkPaUc56LlVdxEm9vKxdvGcVEVMqxcGOu6ayCGzpIgJQSY
zLW5NNX+KiHkFUqbuMZ/OofmV7HR9Dtf9lLY6HLU0AZJv3pjkeJ5FNuRSeXm
JcGp9PshU1gHPnr/C6BY2N0sOQAA

-->

</rfc>
