<?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.15 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-sidrops-bicone-sav-01" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.21.0 -->
  <front>
    <title abbrev="Bicone SAV">Bicone Source Address Validation</title>
    <seriesInfo name="Internet-Draft" value="draft-li-sidrops-bicone-sav-01"/>
    <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>Tsinghua University</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>qlc19@mails.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="2024" month="June" day="14"/>
    <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/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>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 an allowlist filter at the interface facing AS5 and uses a blocklist filter at the interface facing AS2. 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-17" 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="7" month="November" year="2023"/>
            <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-17"/>
        </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:
H4sIAAAAAAAAA91b63bbxrX+j6eY2j8iNiRjUnYtayVpqIsTrcoSK8o9bVOv
rCEwJCcCAQYDSGZc5VnOs5wnO9/eM7gSpKSkXV2rWYlDAHPZ129fZtzr9bxU
p6E6FEfajyMlJnGW+EqMgiBRxoi/yFAHMtVx5MnpNFG35cDRX7wg9iO5xOQg
kbO0F+qe0UESr0xvyoN6Rt72Xgy8eGriUKXKHHrZCsvRD/rfoefjz3mcrA+F
SQPPZNOlNga7Xa9XWPbs9Pqt5+lVcijSJDPp8MWLNy+GnkyUPBSXK5UwZUbI
KBDvZCTnaqmi1LuLk5t5EmerQzE5O7m6HE+8G7XG2+CQyfZkli7i5NATPU8I
HZlDcdIX5xoPlp0TGdnHOJnLSP/M2xyKa6Oj+SKT4n2kb1VidLrGGLWUOgSB
MUkq+iZ1g/oqyPp+hAE+xkFsSv+IL/QcZ1FKLB8vdCQrRJz3xZ91VFBxLiN/
oaK5e/kEWn4K/cGbb+i36f82eo5BQEmQzp/rtPx9EUfzeQZyM8hNTmPoBTot
6Qk1MfLNz3M/lNNfR8i5zip0THXk3jyZkiycPpUQL4qTJXa4hcEKcfX2+OD1
i5f086x30tcqnRVmL81K9lZJPNNhPvYPLw+G28dCdXqmfUu+p6NZY6fhwfC1
+7m/sam8jVTa0yBV9oIYDEa09zRUy55J4VjkDFtmqOSRM3J/lgnNdqS8fvPi
4NDz+v2+5/V6PSGnBjT4qeddL5RYJXopk7UIlNHzSMxjGYp4JoxFFumQ5bZA
FrEHp+wIDT++jXUAFQi9BFnwbzENY/9G7Om+6nftA30O1Vyn2CRVwAU5gwA7
4m4BmQtiKcV/NCrQifJpA+yUrrtCmZXytQzDNaxKrGSS4gFUrsJ4TYwL46tI
Jjo2Ys8oJT59eprg7u8ZiL53BvKh0xenH7VJiRYZ3MIoVUD4A0mEmQWudL2C
8omiuYoIzhRIm7N8aCC+xHchlhAwKGxtxHQtMsMSyk0F8ktUiJkBIEj4QMl4
CcER/PbF9QJSBUpnzB8QMlz/rIxYxSmeifuGoB1PxuorVGG+3QYlWDsWSwh6
qX9WjWW6Iq3tS99ig33L0NElffkLoaIFyQWSWPB7kSp/EcVhPF8TrzAWbTVY
UMI71GSSiy4QU2nwJySyRTog5FYHuXSs7S51EITK856LMzhSHGRsMuLTc6N8
9q343vMmdds1qxguTlqApMAQpEX0L2NQZeDRcYYxys8S2B2+IFylhvZP40Cu
PzO0k0pgUH1xxhNuIQCJf9l8hUxTCV3cwnjjRIAREcpkjmAKS1HiBKwnepoR
Sycq0ta5JlhEg8K9k5N40nFL2MAIGv14uYwjFiFmaZLJLCTfuMV6mJCPd0pN
9Zws0bQz3QWV0fpBdy6NfE/15/Deo+Px/gF7B4HaB6YN7w5ewtEcvMGDSu8R
CwnypkpFuQEFZNBb8aXuWf+NaPJdfKcQMLqQgLplI6vz7MsoilOxVCple6wK
KMgUWyC5F0EOIiEU7fKn7QTuiCyOwKfz1YHnPQSMzmZO34572dX4bdUsnoyZ
jAf4NZMENPiT9y2hkh0M3yGUlcLzaPJ0mFWVffGOjMaQmmb6I/acqhB5Ca1H
KsDgfD6wYHN3vGys/z/IniCpeMUiIy4LpEurW3f5sWBWsM/zV6CxTCXM1L9R
wKI7nS4aHswYLBEkEpAXw8wsUtTWh+IKG3RxIaowvpRr2CAwpsWliPOpsk5H
K8/qK0MtSFZZtLQ3fSjF58j4F8a2LUGtyxbdEq6IsC3Brl8dNgM5NBOKccZp
hRQIuVqFa3oAFeCjZrK5oZL0K7b6KFPlEOJUDOej0kfEXBnFCcuT1KGgbhJq
tMEyrSg3YmqTEmvhG6N0LfYCBwOS/IzZbCqvHnofsuhiq6ZF84ffZMzF0n2b
rSI4B5YXFSHvT1BEBs5YZ3KpQy0Tu0MBQd0a5rVk/vf3XR5Nqf+H7gZKbsv/
7+9B0vPn4kr9lCHYkFkbKgJRz8yVJRZlrKA61ohn795Prp917f/FxSX/vjr9
8/uzq9MT+j35bnR+Xvzw3IjJd5fvz0/KX+XM48t3704vTuxkvBW1V96zd6O/
PbO8PLscX59dXozOn1mZ1twwUU54rDNYAdmGNB5ikY+0xeoBYf///ndAgf93
lA4MBm8QTOzDweA1pQF3sA+7G2OYfYT61h4cSUElmm0ZcLNCFAvJc5GhLOK7
SMDSKbf7/fckmQ+H4supvxq8/Nq9IIZrL3OZ1V6yzDbfbEy2Qmx51bJNIc3a
+4ak6/SO/lZ7zuVeefnlH0MN7OkNDv74tUdJ7LVKAFScQHveWY5UR2T0h+zF
lUQNnpKFqXMVdtKqR1UwfMO5SM0FlLtNoCaXZKBm9pH80swKvEEn4xwEjgEC
h7ylQa4CQB5NaNWIYi+yGHJKFAdFFGYbyEGwl8a9Ak3A/Q2tjOy9xqsYV9B+
YiuZ97zWCJsUIGizfMqm1N29dTHgEKIVFpc0VT2Qp5QQuBENH8ohZDUL2Gsg
+2em04x3E8o3Zzb1sb5QAG4NbZ+2bulj0JlapY/C1mY+Y1RJgUPwjSjGRlZs
3aSr4+K5psVtDlGjA7m3QrUSiFkSL3dFRGBAFgYc9XaTvS272EzJmvmYyKKQ
QjfFVMWFBoI66jF4jLxh4Kf+yIe+QJqb5697ttKppLF55DSlyVTK+6Nvx+L9
+GR0fYp03hgEAFO1nZZ0qEjMkFqhkIRj694C3wPyqbYMylYAJo/OKzm3Jgqr
p9e5fCpJOOV31J9tqryZJnYdsljj38iXJraOEvv9fdqskAkKPngTtBwJk8H9
4U3qo1yuQi6wmVoVNEktiLhjbdQ5L/gduRIXdAOZfzj96/jy6pqdsJpnUvmU
sZPjC0kIuWtkdFokL30EqZme9xxZiFM6DDPqfbEehQGNqNWL0u8xdLeqhhHx
JUSlI2rGTwZbyGe7M9wjGA/YlcfDOhujybC7ZRjEReViTliZfWFOD9tX878j
55T0OiI7yz3StC/ObkpmVFEBCJnGgJPCnkbhPE4AMEsx4nnl8xFloLTXHQTs
8vdKPGqHhpjCx0tQPqygTzuAQeiglSgeInj88ssvntjyz3jw/WjyCgvvkxo+
bB833Dnu817+z+dibzwcfzEeHneqb5sT/on/SACY+mWvMpnevqLvu3ZofdtK
+hf/aHnl5azn2iQz+aJlspVOneOKObXPsaJqEdPe8XDc2TLHfqwO3+R3C69W
kkP3q3yzLxpSfPSKjqp/1B48lsXgQ8VBawOE++4x+7VxlYG5eFpFUw5slUgL
H22fLfeDJvePnC3ILrpkFHtlyE80oiqpvMO+9OlQPK/ApOATxq+ejZ6E5224
+IxbsUvqtCaKHR8lR2vj6Gh01aMPLXWXO8q4v+8028uAtyyNo3jJrbW1SdVS
FCnriM8M3UmT2BtNxqPOw4Uge9AVZweXLKXmOleXWKYoFgmxi66WdGzahkHZ
hClDveHwkAAYQWvC2S3Ism1fLMzpFJXYxCED9EaHoNucYQFX5Q1NSuq5pUmp
F/cKKIWCRpd5EW9IH41FKLTwQS51i/POfq4juwWyavxJXR/iOdCmve8jn5CX
dSkBC1x610g6PO/yliaGXRpqSKM2KaX+AJnkR2rVU+pTaV5yaGMeijKgbmz2
DKM4KFGb7bCcwSJT38ngI6qAM1dx+9IoK9uyBVPf2uZgbQnYrpObSjPLZHOk
nemOvtLmWUzeEMgzIC7Nvo1RoZNwK1cHvMpGUi95SSxPlVLN7Df7ZFxopQ+2
dGW9LkBmPSMtT1uOtMhuN1jhxhplpODdnstQH90cet6gL0btRwu1XmDOVXEM
8cg0pqXCqfMCymZt7ddm+5CMgM9QtjRCa8rG9vFyqaLA5EtXRMLtAarOioTQ
84Z98W7r8YjDhtaVHm5x1tktEcS1HalBYDmpCdBu9mCt2tqJfIQ0//2UUpb1
hJOCjWMC7v98W3Yjap0O2/w4q7Qirspy8jhfh/oylcOZnWcyRZDtWD6VPV2s
RbCNs5gnO26/yZTt7zzMU63X5Bo9OWH33Gf9k1qLs0DJ/NZCxSwIrGw3ipqb
QOuIu5j/uo4VUVVEobIANSb2NXPAdQvv0dZAz9sc1mSs4KkB2lLn7AKZaL3r
aOHRfY764YAjzZ2C7TgEa57GX9dyn8oRgJXyTCcUD2wg1Vgwl47tVlSlU6ih
zEtGk954dP0dd583eyvMQ9TFUkUqsuP4jutgu3d9Xz5uj/wwC/gAIm5pkpTH
D+Jku2ZyrWw4/baOXHP1XAvlkRsEfBHTeRz14fSsNF2yoVp6st3qqA2fyzRp
yxGbGUlJDyd9vJWVT+sJXwOad+U65crkfTabtFBbXM7ITx63iZa09Wtky8YC
ypGl1EKoox4TEEgDbQ+mfXuQIympjsCtvQiiJLXL+fzLdsaflyAHGAN2+SrI
EmDxCLKFH4Ug3x6hrPJKqZTAvJy5ymeyv1JXho8GbdZyTBdRVBXESAk2chNc
xVGEX9ipLHomF4RVNExTQ6ZH8/6+N+hQc3O4bcUs0j9l5CM/kMuxAEfBj72r
syPTO4vyUZtxIN+WBLLfF29h+4yq9fWsli7E3sXXgw5TCL/lGx2omy9++DS4
p6IGP4b40e/33ZPOX+vPB7UPF/cfXPPQjSPRcQubEfiCyXdbk8nQJ4tF9NFd
JnE721tsD4mUE7g2QdVuvPhkffCoOd0bEpNUrcQBBPOyL84hai2+Ehee9wow
opyN4R1VGr0BRv2B98gZkq7mZNB0IrAXjgqymEke/ZlhF2eejPUZx53tJ+bz
65xvlbkFXzepw7jhICCwmxY2xUMr3O6Dj9fMB5j9Sgy69Y/iNCRYqLx7hQkH
Vjw3EA/J4Q2hSC6fGxp58zm9H7wojLeg4KZj4/pF5fDYIlZlTA90TjP7sRAr
B9/Ceu0EAknOItalEVUWIRoGTknl/rCeKKMiNeXSmhj5YSk/ghnMacpnMMxl
wFUT2SUMyoJDdVEX/ioMSLMxoLLuG6JtSH16uiPGhmqbCZEreLnZX/Ieu8YG
cWnqjBLxHfbkBn0OMUxby8fwvsr2Ekr0GfMwXnnMKoQJ2AyQJrku9JOhpit8
awYyR7CWthZfRWxTpOOvjURqLA9etvFeY8S2WGvzxIjuitjQZyfRB3bXEvPx
tr08Oa4kdOcuuo1dIv1cUBcklCtxhJKecKaeJRMtjVrgzHV4KrfZbBlALB2f
XPCck8lVeeZRO+n/lbfedrbtgClOSVzicm/Gniy0Ji18++YpdVQ1vNcvKdUb
BWUyQp0x20pKkDOs4sj2BiqHEJSdEIV5VszKtUxwP4abBM1C/a4sTVsuxZSE
LKlRAoxD2lpabwFhMjRxvm/7na7nYpIt+UolrPMqbwS4u4G2cipaLyidKC4/
7Z6STT/OrNs3u0lQ4g3oNZS0bOtnuYz8t3UH4aDalI0OWyZudO1c6Z6fQm98
oJYQN6joGq6fNhofJPZoo5nksqVtAsjvbUIO/1ExbN7wStsts2+NwHXzu9bR
awejrdss3KEeX5FrE7q7hrJhWXTkRb5nJ7ZeV9syb1hWEXdy3bWNOUsF1Q1b
3G733V+bme6oq0FubafKIeav6gONJgNKqPbzZOrVIygY/hYKdpfq+ek0A0d+
yz3vZ9RQI78D767WFFfi/frgWsTYfc2uiAL/vkt4FjDpviY1GVgAlRtulHOQ
D5b1tbwjlHU5TXn7NNHmpnLXtHFCUu2SVe5Idd3NB0PHJ5ASfCpzlR3bP//l
OcgrlBarx386g+ZXsdH015zsPajRxaihDZJ+9ZIeQVgU25FJ5bIhdRDpr0RM
YR346f0/JcMqlx44AAA=

-->

</rfc>
