IGP Flexible Algorithms (Flex-Algorithm) In IP Networks
draft-bonica-lsr-ip-flexalgo-01

Document Type Active Internet-Draft (individual)
Authors William Britto  , Shraddha Hegde  , Parag Kaneriya  , Rejesh Shetty  , Ron Bonica  , Peter Psenak 
Last updated 2020-11-15
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
LSR Working Group                                              W. Britto
Internet-Draft                                                  S. Hegde
Intended status: Standards Track                             P. Kaneriya
Expires: May 19, 2021                                          R. Shetty
                                                               R. Bonica
                                                        Juniper Networks
                                                               P. Psenak
                                                           Cisco Systems
                                                       November 15, 2020

        IGP Flexible Algorithms (Flex-Algorithm) In IP Networks
                    draft-bonica-lsr-ip-flexalgo-01

Abstract

   An IGP Flexible Algorithm (Flex-Algorithm) allows IGP to compute
   constraint-based paths.  As currently defined, IGP Flex-Algorithm is
   used with Segment Routing (SR) data planes - SR MPLS and SRv6.
   Therefore, Flex-Algorithm cannot be deployed in the absence of SR.

   This document extends IGP Flex-Algorithm, so that it can be used for
   regular IPv4 and IPv6 prefixes.  This allows Flex-Algorithm to be
   deployed in any IP network, even in the absence of SR.

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 May 19, 2021.

Copyright Notice

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

Britto, et al.            Expires May 19, 2021                  [Page 1]
Internet-Draft              IP Flex-Algorithm              November 2020

   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
   2.  Requirements Language . . . . . . . . . . . . . . . . . . . .   3
   3.  Egress Node Procedures  . . . . . . . . . . . . . . . . . . .   3
   4.  Advertising Flex-Algorithm Definitions (FAD)  . . . . . . . .   3
   5.  Advertising IP Flex-Algorithm Participation . . . . . . . . .   3
     5.1.  The ISIS IP Algorithm Sub-TLV . . . . . . . . . . . . . .   4
     5.2.  The OSPF IP Algorithm TLV . . . . . . . . . . . . . . . .   5
   6.  Advertising IP Flex-Algorthm Reachability . . . . . . . . . .   6
     6.1.  The ISIS IPv4 Algorithm Prefix Reachability TLV . . . . .   6
     6.2.  The ISIS IPv6 Algorithm Prefix Reachability TLV . . . . .   8
     6.3.  The OSPFv2 Algorithm Prefix Reachability TLV  . . . . . .   9
     6.4.  The OSPFv3 Flex-Algorithm IP Prefix Opaque LSA  . . . . .  11
   7.  Calculating of IP Flex-Algorthm Paths . . . . . . . . . . . .  11
   8.  IP Flex-Algorthm Forwarding . . . . . . . . . . . . . . . . .  12
   9.  Deployment Considerations . . . . . . . . . . . . . . . . . .  12
   10. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  13
   11. Security Considerations . . . . . . . . . . . . . . . . . . .  14
   12. Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .  14
   13. References  . . . . . . . . . . . . . . . . . . . . . . . . .  14
     13.1.  Normative References . . . . . . . . . . . . . . . . . .  14
     13.2.  Informative References . . . . . . . . . . . . . . . . .  15
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  16

1.  Introduction

   An IGP Flex-Algorithm as specified in [I-D.ietf-lsr-flex-algo]
   computes a constraint-based path to:

   o  All Flex-Algorithm specific Prefix Segment Identifiers (SIDs)
      [RFC8402].

   o  All Flex-Algorityhm specific SRv6 Locators
      [I-D.ietf-spring-srv6-network-programming].

   Therefore, Flex-Algorithm cannot be deployed in the absence of SR and
   SRv6.

Britto, et al.            Expires May 19, 2021                  [Page 2]
Internet-Draft              IP Flex-Algorithm              November 2020
Show full document text