<?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.6 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-li-lsr-extensions-for-spi-00" category="std" consensus="true" submissionType="IETF" version="3">
  <!-- xml2rfc v2v3 conversion 3.20.0 -->
  <front>
    <title abbrev="IGP Extensions for SPI">IGP Extensions for Source Prefix Identification</title>
    <seriesInfo name="Internet-Draft" value="draft-li-lsr-extensions-for-spi-00"/>
    <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="C." surname="Lin" fullname="Changwang Lin">
      <organization>New H3C Technologies</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>linchangwang.04414@h3c.com</email>
      </address>
    </author>
    <date year="2024" month="March" day="04"/>
    <area>Routing</area>
    <workgroup>lsr</workgroup>
    <keyword>SAV</keyword>
    <abstract>
      <?line 52?>

<t>This document proposes a new intra-domain SAV solution, called Source Prefix Identification (SPI), and designs IGP extensions for implementing SPI.</t>
    </abstract>
  </front>
  <middle>
    <?line 56?>

<section anchor="sec-intro">
      <name>Introduction</name>
      <t>Intra-domain source address validation (SAV) plays an important role in defending against source address spoofing attacks in intra-domain networks. However, existing intra-domain SAV solutions (e.g., BCP38 <xref target="RFC2827"/> and BCP84 <xref target="RFC3704"/>) have problems of high operational overhead or inaccurate validation (see <xref target="I-D.ietf-savnet-intra-domain-problem-statement"/>).</t>
      <t>To address these problems, <xref target="I-D.li-savnet-intra-domain-architecture"/> proposes the architecture of intra-domain SAVNET and introduces the use of SAV-specific information. According to the intra-domain SAVNET architecture, this document proposes a new intra-domain SAV solution, called Source Prefix Identification (SPI), and designs IGP extensions for implementing SPI.</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>SAV Rule: The rule in a router that describes the mapping relationship between a source address (prefix) and the valid incoming interface(s). It is used by a router to make SAV decisions and is inferred from the SAV Information Base.</t>
      <t>Host-facing Router: An intra-domain router of an AS which is connected to a host network (i.e., a layer-2 network).</t>
      <t>Customer-facing Router: An intra-domain router of an AS which is connected to a customer network running the routing protocol (i.e., a layer-3 network).</t>
      <t>AS Border Router: An intra-domain router of an AS which is connected to other ASes.</t>
    </section>
    <section anchor="sec-spi">
      <name>Source Prefix Identification (SPI)</name>
      <t>SPI aims to achieve accurate intra-domain SAV in host-facing routers, customer-facing routers, and AS border routers in an automatic way. In the following, this document describes how SPI works to meet the design goals of intra-domain SAVNET.</t>
      <section anchor="spi-on-host-facing-or-customer-facing-routers">
        <name>SPI on host-facing or customer-facing routers</name>
        <t>SPI on a host-facing (or customer-facing) router aims to identify source prefixes belonging to its host (or customer) network. After that, the host-facing (or customer-facing) router can perform accurate SAV filtering by only accepting data packets from its host (or customer) network with source addresses belonging to that network.</t>
        <t>If the host (or customer) network is single-homed, the host-facing (or customer-facing) router can easily identify source prefixes through its local routes to that network. However, if the host (or customer) network is multi-homed, the router may fail to identify all source prefixes of that network in the scenario of routing asymmetry (see <xref target="I-D.ietf-savnet-intra-domain-problem-statement"/>). To achieve accurate SAV on routers facing multi-homed host (or customer) networks, SPI allows routers facing the same network to identify source prefixes of the network through SPI information.</t>
        <figure anchor="fig-example">
          <name>Source prefix identification for a multi-homed host (or customer) network</name>
          <artwork><![CDATA[
+-----------------------------------------------------+
|  AS                                                 |
|                 [10.1.0.0/16]+[tag n]               |
|  +----------+ +---------------------> +----------+  |
|  | Router A |        SPI info         | Router B |  |
|  +------+#+-+ <---------------------+ +-+#+------+  |
|          +      [10.0.0.0/16]+[tag n]    +          |
|          |                               |          |
|          |                               |          |
|          |    +--------------------+     |          |
|          |    | Host (or Customer) |     |          |
|          +----+    Network N       +-----+          |
|               +--------------------+                |
|                   (10.0.0.0/15 )                    |
+-----------------------------------------------------+
]]></artwork>
        </figure>
        <t><xref target="fig-example"/> shows the process of identifying source prefixes for a multi-homed host (or customer) network. In this example, due to traffic engineering, Router A only learns the route to sub prefix 10.1.0.0/16 from Network N, while Router B only learns the route to the other sub prefix 10.0.0.0/16 from Network N. A detailed description of SPI procedure is as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Each host (or customer) network is assigned a unique tag value and all router interfaces facing the network are configured with the same tag value. For example, if Network N is assigned tag n, Interfaces '#' in Router A and Router B will be configured with tag n as well.</t>
          </li>
          <li>
            <t>Each host-facing (or customer-facing) router provides SPI information to other intra-domain routers. The SPI information contains the prefixes learned through its local routes to its host (or customer) network and the tag value of the network. For example, Router A will send SPI information to other intra-domain routers containinig prefix 10.1.0.0/16 and tag n.</t>
          </li>
          <li>
            <t>When a router receives SPI information with the same tag value as its host (or customer) network, it considers that the prefixes contained in the SPI information also belong to the host (or customer) network. For example, Router B will identify prefix 10.1.0.0/16 as a source prefix of Network N after receiving the SPI information provided by Router A.</t>
          </li>
          <li>
            <t>By integrating prefixes learned through SPI information with prefixes learned through its local routes, the host-facing (or customer-facing) router can identify all source prefixes of its host (or customer) network. For example, Router B will identify that both prefix 10.1.0.0/16 and prefix 10.0.0.0/16 belong to Network N after receiving the SPI information provided by Router A. Similarly, Router A will also identify complete source prefixes of Network N after receiving the SPI information provided by Router B.</t>
          </li>
        </ol>
      </section>
      <section anchor="spi-on-as-border-routers">
        <name>SPI on AS border routers</name>
        <t>After receiving SPI information from host-facing and customer-facing routers, AS border routers can identify source prefixes of the AS accordingly.</t>
      </section>
    </section>
    <section anchor="igp-extension-considerations-for-spi">
      <name>IGP Extension Considerations for SPI</name>
      <t>In the following, this Section introduces IS-IS extensions and OSPF extensions for communicating SPI information among intra-domain routers, respectively. The key idea is to add the tag value into the prefix information when the host-facing (or customer-facing) router distributes or propagates the prefix information of its host (or customer) network.</t>
      <section anchor="sec-isis">
        <name>IS-IS Extension Considerations for SPI</name>
        <t>For host-facing routers running IS-IS protocol，they can carry the tag in the Administrative Tag Sub-TLV <xref target="RFC5130"/> when distributing IP prefix information.</t>
        <t>For customer-facing routers running IS-IS protocol, they should add the tag in the prefix information received from the customer network. In this case, since they cannot use the Administrative Tag Sub-TLV, it may be necessary to define a new Sub-TLV to carry the tag. For example, as shown in <xref target="fig-isis"/>, a new Sub-TLV (called Link-tag Sub-TLV) in Extended IS Reachability (22) can be defined to carry the tag of a customer network.</t>
        <figure anchor="fig-isis">
          <name>New Link-Tag Sub-TLV of IS-IS</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |     Type      |    Length     |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                      Link Tag                                 |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>The detailed design is TBD.</t>
      </section>
      <section anchor="sec-ospf">
        <name>OSPF Extension Considerations for SPI</name>
        <t>For host-facing routers running OSPF protocol, they have the capability to carry the tag in the Route-Tag when distributing IP prefix reachability information. To this end, a new Route-Tag Sub-TLV under the OSPFv2 Extended Prefix TLV in the Extended Prefix Opaque LSA (see <xref target="RFC7684"/>) can be defined to convey the tag information. The format for the new Route-Tag Sub-TLV definition is as follows:</t>
        <figure anchor="fig-ospfroute">
          <name>New Route-Tag Sub-TLV of OSPF</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |       Type - Route Tag        |          Sub-TLV Length       |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                          Route Tag                            |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>For customer-facing routers running OSPF protocol, as the prefixes in the LSAs sent by the peer devices do not include a tag, it is alternative to extend the carrying of tags in the neighbor information. A new Sub-TLV (called Link-Tag Sub-TLV) can be defined under the OSPFv2 Extended Link TLV in the Extended Link Opaque LSA, as specified in <xref target="RFC7684"/>, to convey the tag information. The format for the new Sub-TLV definition is as follows:</t>
        <figure anchor="fig-ospflink">
          <name>New Link-Tag Sub-TLV of OSPF</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |       Type - Link Tag        |          Sub-TLV Length        |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                          Link Tag                             |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>The detailed design is TBD.</t>
      </section>
      <section anchor="sec-ospfv3">
        <name>OSPFv3 Extension Considerations for SPI</name>
        <t>For host-facing routers running OSPFv3 protocol, they can include the tag in the Route-Tag Sub-TLV <xref target="RFC8362"/> when distributing IP prefix reachability information. The Route-Tag Sub-TLV can serve as a Sub-TLV under the Inter-Area-Prefix TLV, Inter-Area-Router TLV, and External-Prefix TLV, carrying tag information for corresponding types of routes.</t>
        <t>For customer-facing routers running OSPFv3 protocol, given that the prefixes in the LSAs sent by peer devices do not include a tag, it is alternative to expand the inclusion of tags in neighbor information. A new Sub-TLV (called Link-tag Sub-TLV) under the OSPFv3 Router-Link TLV in the OSPFv3 E-Router-LSA, as specified in <xref target="RFC8362"/>, can be defined to convey the tag information. The format for the new Sub-TLV definition is as follows:</t>
        <figure anchor="fig-ospfv3">
          <name>New Link-Tag Sub-TLV of OSPFv3</name>
          <artwork><![CDATA[
     0                   1                   2                   3
     0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |       Type - Link Tag        |          Sub-TLV Length        |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
    |                          Link Tag                             |
    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>The detailed design is TBD.</t>
      </section>
    </section>
    <section anchor="sec-security">
      <name>Security Considerations</name>
      <t>TBD</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="I-D.li-savnet-intra-domain-architecture" target="https://datatracker.ietf.org/doc/html/draft-li-savnet-intra-domain-architecture-06" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.li-savnet-intra-domain-architecture.xml">
          <front>
            <title>Intra-domain Source Address Validation (SAVNET) Architecture</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="Nan Geng" initials="N." surname="Geng">
              <organization>Huawei</organization>
            </author>
            <author fullname="Li Chen" initials="L." surname="Chen">
              <organization>Zhongguancun Laboratory</organization>
            </author>
            <author fullname="Mingqing(Michael) Huang" initials="M." surname="Huang">
              <organization>Huawei</organization>
            </author>
            <author fullname="Fang Gao" initials="F." surname="Gao">
              <organization>Zhongguancun Laboratory</organization>
            </author>
            <date day="21" month="January" year="2024"/>
            <abstract>
              <t>This document proposes the intra-domain SAVNET architecture, which achieves accurate source address validation (SAV) in an intra-domain network by an automatic way. Compared with uRPF-like SAV mechanisms that only depend on routers' local routing information, SAVNET routers generate SAV rules by using both local routing information and SAV-specific information exchanged among routers, resulting in more accurate SAV validation in asymmetric routing scenarios. Compared with ACL rules that require manual efforts to accommodate to network dynamics, SAVNET routers learn the SAV rules automatically in a distributed way.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-li-savnet-intra-domain-architecture-06"/>
        </reference>
        <reference anchor="RFC5130" target="https://www.rfc-editor.org/info/rfc5130" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5130.xml">
          <front>
            <title>A Policy Control Mechanism in IS-IS Using Administrative Tags</title>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="M. Shand" initials="M." role="editor" surname="Shand"/>
            <author fullname="C. Martin" initials="C." surname="Martin"/>
            <date month="February" year="2008"/>
            <abstract>
              <t>This document describes an extension to the IS-IS protocol to add operational capabilities that allow for ease of management and control over IP prefix distribution within an IS-IS domain. This document enhances the IS-IS protocol by extending the information that an Intermediate System (IS) router can place in Link State Protocol (LSP) Data Units for policy use. This extension will provide operators with a mechanism to control IP prefix distribution throughout multi-level IS-IS domains. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5130"/>
          <seriesInfo name="DOI" value="10.17487/RFC5130"/>
        </reference>
        <reference anchor="RFC7684" target="https://www.rfc-editor.org/info/rfc7684" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7684.xml">
          <front>
            <title>OSPFv2 Prefix/Link Attribute Advertisement</title>
            <author fullname="P. Psenak" initials="P." surname="Psenak"/>
            <author fullname="H. Gredler" initials="H." surname="Gredler"/>
            <author fullname="R. Shakir" initials="R." surname="Shakir"/>
            <author fullname="W. Henderickx" initials="W." surname="Henderickx"/>
            <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
            <author fullname="A. Lindem" initials="A." surname="Lindem"/>
            <date month="November" year="2015"/>
            <abstract>
              <t>OSPFv2 requires functional extension beyond what can readily be done with the fixed-format Link State Advertisements (LSAs) as described in RFC 2328. This document defines OSPFv2 Opaque LSAs based on Type-Length-Value (TLV) tuples that can be used to associate additional attributes with prefixes or links. Depending on the application, these prefixes and links may or may not be advertised in the fixed-format LSAs. The OSPFv2 Opaque LSAs are optional and fully backward compatible.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7684"/>
          <seriesInfo name="DOI" value="10.17487/RFC7684"/>
        </reference>
        <reference anchor="RFC8362" target="https://www.rfc-editor.org/info/rfc8362" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8362.xml">
          <front>
            <title>OSPFv3 Link State Advertisement (LSA) Extensibility</title>
            <author fullname="A. Lindem" initials="A." surname="Lindem"/>
            <author fullname="A. Roy" initials="A." surname="Roy"/>
            <author fullname="D. Goethals" initials="D." surname="Goethals"/>
            <author fullname="V. Reddy Vallem" initials="V." surname="Reddy Vallem"/>
            <author fullname="F. Baker" initials="F." surname="Baker"/>
            <date month="April" year="2018"/>
            <abstract>
              <t>OSPFv3 requires functional extension beyond what can readily be done with the fixed-format Link State Advertisement (LSA) as described in RFC 5340. Without LSA extension, attributes associated with OSPFv3 links and advertised IPv6 prefixes must be advertised in separate LSAs and correlated to the fixed-format LSAs. This document extends the LSA format by encoding the existing OSPFv3 LSA information in Type-Length-Value (TLV) tuples and allowing advertisement of additional information with additional TLVs. Backward-compatibility mechanisms are also described.</t>
              <t>This document updates RFC 5340, "OSPF for IPv6", and RFC 5838, "Support of Address Families in OSPFv3", by providing TLV-based encodings for the base OSPFv3 unicast support and OSPFv3 address family support.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8362"/>
          <seriesInfo name="DOI" value="10.17487/RFC8362"/>
        </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="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="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>
      </references>
    </references>
    <?line 223?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1aa3IbxxH+v6fokD9MhtgNQFAShXJsgw9FrKJImoCccqn4
Y7A7ACZa7MA7u6ARiTpBDpGD5FculCuke2b2iQUByrIrqTJkWcA8evr5dffs
uq7rJCIJeQ8u/nID5z8nPFJCRgrGMoaBTGOfw03Mx+JnuAh4lIix8FmCKxw2
GsV80bzv5sIJpB+xGdINYjZO3FC4oYpdni90caGr5sJttx05UjLkCVc9J50H
TH+hf3oOnsUnMl72QCWBo9LRTCjaPlzOieXz4SvHEfO4B0mcquSw3X7ZPnRY
zFkPbmWaiGji3Mv4/SSW6bwHyIHzni9xJOjBoP+D47A0mcq454DrAIhI9eDM
g0uBPwzzZywyP2U8YZH4uxa9B0OFlKcpg7eRWPBYiWSJa/iMiRBZkaEIWPRd
Yhd5PEg9P8IFPq7rwQkXfyPG8LdMo4SEO52KiJWYuPTgexHlXFyyyJ/yaGIH
n8DLT6HfefkdfVfeL+DnlJRS8HM6ZdHkHv/a0SpDV/weXndPYcj9aSRDORFc
FRyFAmWx27320VHn6Ltp1/d8OdvMkBPJeIanLNAzAC7cMw/dSrFFxBNX4ELm
BhJPiVwW+1ORcD9JY7309tXps063bb++eH58ZL8ed58f9hwRjeuEBU/GjaTn
sRyFfOaqBF1zhhFhKR0eH76wX7sv2kjfcTzPcxzXdYGNFFLwE8cZToUCDI2U
dgLSmkvFFTCIUGnlc8g9AaMiJZ22wGdhyINHAxL2MOz2W8CiAAKuxASDkWKT
V2NTzOah5hs1TIFqWZyJIAi54+zCBXIhg9TXND/sKu5rBcgHx7koM6gMLywI
Yq4ULBh5vWWk/8M+zEO2RMkiOlHGCUN5Y4xylBLZG/MoIAbYBEmppE5MzaUc
6/kkYf57RZsq2kGzUFwrD17Le45u30I5hdJCrVWjgj3uTbwWnJzedI/hnbXa
nVYZjh0f6TEy390+TNmCg7W2AjmGqZhMQc55rKVkIUg8d8pZAKTWiPl+ilO8
ognFOXz48DSHenjYR6MMZa6NZMpVwUrLEtzC9R8eChdDIlCeI4nqmro6H2pd
COsCdluq9GpcgIDNffI4yENGRh70fR8hlXSfSL2jkXDp8Bau+h8MBGd3F275
T6mI9YQi4J2kbMIpcDlg6gDKHQp23rwdDHda5l+4utbfb8+/f3txe35G3wev
+5eX+RfHrhi8vn57eVZ8K3aeXr95c351ZjbjKFSGnJ03/R93jEQ71zfDi+ur
/uUOBUVVjZj4yAIjbQAez2PMqQEw5aAa/FiMOJmWPP3f/+wcoRv9gSKg03mJ
fmJ+HHdeHOGPe0w25jQZhUv7E+26dNh8zhl5O6Ad0BhzkbAQXZJhzE7lfQRT
HnPU5B/fkWbuevD1yJ93jr6xAyRwZTDTWWVQ62x1ZGWzUWLDUMMxuTYr4zVN
V/nt/1j5nem9NPj1t5jNOLid42+/Ie/BlBfPhM55S8chx71NqbQi54lTg30M
UTBF46A+WQKZYUygzVC95I0xD7Unq6mYozWTe85pYw0k9+ba+/e1oWi7Bh48
A3OpxUEej5nP99S+BxcJoKtgKAcwWpa4kHjqe66jLMDYNvGhQYBQd8zjGHeM
YznTR9CyiyL04YQpMvdrqRIXj6JjbzXhHvRrkG0PRCDBnNAfoFcJf0qn+DKK
EBbwGGSGwRRpZfgOe8LjCNgMMJnw2D3MJgghT7HikzMc/UIH+5ZefnicRpEG
NTKfqSYJqRLpy7DOWbfMGR5ygjiBpH4ZTxJPjnGaK4+8azPo2XyNZTVmaxwA
JjB3kXSIvZgmIU9SKxCL/0xLVjQMYmT7NS3nE+QjyPnICGqHtYfjfynuQb58
uGdL9L1I63Asw1DeI5E6/BdRgBhCWAw6uWvn5DzRmw2Sw0Qi3qzJXZ4GcNou
q8Ig2q8Rw2hJRtbvstm91R37mc0ylQqj/2UWliYaUYYRD2U0sdlQJMp4dJnk
fuYsmDrHGRZohN2aCx+1jKUIRWJhVLLjWIQ4T9sxzDV84zSfa+fFqoTBHAsq
jlzpmH6cPbgXybQGO3UBNYxl4mCJOM7FWEMTDU+NSMjdKU4ETxebMyVQrLX6
T6a4GEs1ki2UWDCYzWqF26J2FNtwPUvDRJSZtjzN2BLG2NtUnILSY50xOa6c
b/I3B+XziMVC0nwGM0wtZzOOrc/nl5AwbAh78hAZ5dFqNV6S7BEdYMxrSKEg
VnUSWhBsDnPhHosQadSdL7UGI+qVutJxPn365By4n/M5cD4C4dNTPx9pX+3z
rtP2Ol7ba/+p8/zu4F3CJhDdNe0rsXoAzXx/U11k9n20iQL6kJ+eaaM4IVt0
QovK5x3sHiCpr5v1gItovnJe9jko5Gs3yXewRi+rKqop49fY16jPg837PsLr
zKdPc5/++Oi+g5z0lfXRq/KMu04vpSWNfMJj++izV1jiGew3LMB9nxsPFEsf
erA7FhOX/8yo/QF99/fnnUE5QLO4zSoLapbYlhixg3XHhw+lE7CboMbA1LeI
Uz5VrpS+LTYQdtTh4SkH2uIC4dke2IIg1V0Q4uOYOlVOqYrrlNgqwkxnxhB7
mUgVWE7bVDrK9FCKepMtc2doUcGG6ssDci05+mHKuCrhdjNhLAiw0kkwm/DA
lkVzbQTqvxEQtAYDat9RYqZsSaV6jtPx4BzhfkMOY4qqKGoKIY3ET6QpDHZs
HPAbFXSUtmxay9uHCsZntKjVxFoVLZ1Sg6ALhTwH5DQ9eIWc5JbBNFvEU5kb
jTgtunrKjvxq9yvKj7m9iLlc2/cC2Rw1MEBkSC33PAyxGDks6WSb6gK1u0DH
VPVMVNTiDUW88nR/V9+CvCV0t2Ud37q2dhES+JEaZUNNlnV7heGq6bSm81yD
WmmK4+4nSZcJgn8mTYGh2SG9o767Hvx1yks9bsx9LhYNCl3jL2S7x8VHJ0qI
JYV2ipWppyoatuyaq46kwTDYP0hbwmYB+hi8NCnTemBe3zSpRRUNu52WZe9n
40I/WWzVObXuqBv2zIxUFB15cLLU8Tmhu8host6/GvW+tTc+vTbfVP9uaoe2
0ba2+Ujmgqy4YwPKFvb+EiYYiJkIWRwu6+GlfStn1JckB+aBBkX8YjZO7H2l
7V9XOnHH6dcI14nqzFM2Lulubbu/2upX7L2mxMddLLscDpf6FqPyvBBObSib
+6786aGz5spgwM1zidIN9cXAvRiUL3dJjOvBzav6hS+aY4ZJz2dJkzbYTNaf
HeSyY987p4MXHGWA7CoY2WaUxRJ9U1/DZCQkS8BUDULCyKdEViBUEouRThBS
p6k5m7CEq3UnbI404zxGd5uskT0FUkJheUch2nBTlN+WGZrZPdl//vUPujjW
zuKzOF7merLw3A9mmFro+RjpF4Y4M0hH7vDyB/0whh7b3RmN5VrQp9w0yO0Z
7tb48BoOzc02ValpGFQsaTls0K/Na6WL0frlYVGX+kwhlikRYXhkqohkop+q
PK4AnevodmFEyZ0qZ0b6k/T8jO6dzcOSTFs4XlFwDUzzG3qUylTo2p4PrRqZ
PfuE5VJE792kYGafNmpPIRxC/d1yLK3YSIQiWcLe4eG+tvGIW+6CFYb0beeq
okyTr3ubdkO/02kYO2wY62YkOjjdhSN4Bs/hBRzDy6eMOaaB2/BHrzLtG72I
YBsz+t8ldhuYmEyjthWtJ5y18iEbaYfZ9PlSvJRbSHKfrH+kR/7aYcrhi+bW
kUY94VDf4BZ9DV3l4vbhyZm5tNV4vSUOSTUfb4FDmmQtyPUzXR2ubJ657oqb
2rDXeVYL9Bj6xOUoqFxeDaXtS6Mgi7GCZKajNAr09S/X7C4Oiwizt/y0yDJU
n7qeM2rgLgd9c0n4zr7acNcYiTJa8LKMZU51oqWfWtOml2jiVtMTJgHX2s//
uxh+UtzpKHeNRsoBV4rLTEclBPhNMIA+K3w1fX4NDKBQtFcdBRCs+g0iAbn3
zsN2+bkWuazWQ9twQL9X1M8mVBTrBZxKJb4QVBUGEijJYtYN04BSJXq9zqfk
uPSEJDLpFkNDl4mBhQUEAv3EaEwb8rMiLibTkX7No/zaw/rEOSwnzlo0ro95
g+cNEa8ning32dy8imEa3Tz2W58Z7L+HuAnxekrdFOG/VYhvlep/rRAP6fAN
qT4L8G0y/aL7lFy/6G6Z7ZFsLd/rFtVCwNr0Xm436H3Ax9uNRxJ+I1ViQfF4
wc2V0Gri15eebh/pukXOb5WHbcevh6m5Jd0hfoWV9Tl01SLetr4x9bDSvHSX
oKur7GmjfrdgW1SuaHiC+Bk13MA14fPnY/M8u+/Uy5XtbjNwfjIwVzqaGhJ3
7d2KW8fhzGfdbH4dBGv3aX2Z8ut3RP4dkdciMnrjFni86G5GZLpSS2MCsxoQ
21eJ7CzROTnT93f9q35tbf295il6aSTNyrj0PiXdOrmuCyPmv8evzn8BhP0z
3n4wAAA=

-->

</rfc>
