Enhanced Feasible-Path Unicast Reverse Path Filtering
draft-ietf-opsec-urpf-improvements-01

Document Type Active Internet-Draft (opsec WG)
Last updated 2018-10-21
Replaces draft-sriram-opsec-urpf-improvements
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
OPSEC Working Group                                            K. Sriram
Internet-Draft                                             D. Montgomery
Intended status: Best Current Practice                          USA NIST
Expires: April 24, 2019                                          J. Haas
                                                  Juniper Networks, Inc.
                                                        October 21, 2018

         Enhanced Feasible-Path Unicast Reverse Path Filtering
                 draft-ietf-opsec-urpf-improvements-01

Abstract

   This document identifies a need for improvement of the unicast
   Reverse Path Filtering techniques (uRPF) [BCP84] for source address
   validation (SAV) [BCP38].  The 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 [BCP84].  However, as shown in this draft, the existing
   feasible-path uRPF still has short comings.  This document describes
   an enhanced feasible-path uRPF technique, which aims to be more
   flexible (in a meaningful way) about directionality than the
   feasible-path uRPF.  It can potentially alleviate ISPs' concerns
   about the possibility of disrupting service for their customers, and
   encourage greater deployment of uRPF techniques.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on April 24, 2019.

Copyright Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

Sriram, et al.           Expires April 24, 2019                 [Page 1]
Internet-Draft              Enhanced FP-uRPF                October 2018

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
     1.1.  Requirements Language . . . . . . . . . . . . . . . . . .   3
   2.  Review of Existing Source Address Validation Techniques . . .   3
     2.1.  SAV using Access Control List . . . . . . . . . . . . . .   4
     2.2.  SAV using Strict Unicast Reverse Path Filtering . . . . .   4
     2.3.  SAV using Feasible-Path Unicast Reverse Path Filtering  .   5
     2.4.  SAV using Loose Unicast Reverse Path Filtering  . . . . .   6
     2.5.  SAV using VRF Table . . . . . . . . . . . . . . . . . . .   7
   3.  SAV using Enhanced Feasible-Path uRPF . . . . . . . . . . . .   7
     3.1.  Description of the Method . . . . . . . . . . . . . . . .   7
       3.1.1.  Algorithm A: Enhanced Feasible-Path uRPF  . . . . . .   8
     3.2.  Operational Recommendations . . . . . . . . . . . . . . .   9
     3.3.  A Challenging Scenario  . . . . . . . . . . . . . . . . .   9
     3.4.  Algorithm B: Enhanced Feasible-Path uRPF with Additional
           Flexibility Across Customer Cone  . . . . . . . . . . . .  10
     3.5.  Augmenting RPF Tables with ROA and IRR Data . . . . . . .  11
     3.6.  Implementation Considerations . . . . . . . . . . . . . .  11
       3.6.1.  Impact on FIB Memory Size Requirement . . . . . . . .  11
       3.6.2.  Coping with BGP's Transient Behavior  . . . . . . . .  12
     3.7.  Summary of Recommendations  . . . . . . . . . . . . . . .  13
   4.  Security Considerations . . . . . . . . . . . . . . . . . . .  13
   5.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  13
   6.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .  14
   7.  Informative References  . . . . . . . . . . . . . . . . . . .  14
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  16

1.  Introduction

   This internet draft identifies a need for improvement of the unicast
   Reverse Path Filtering (uRPF) techniques [RFC2827] for source address
   validation (SAV) [RFC3704].  The strict uRPF is inflexible about
Show full document text