Flexible Algorithm Definition Advertisement with BGP Link-State
draft-ketant-idr-bgp-ls-flex-algo-00

• Status
• IESG evaluation record
• IESG writeups
• Email expansions
• History

• Versions
• 00

Inter-Domain Routing                                       K. Talaulikar
Internet-Draft                                                 P. Psenak
Intended status: Standards Track                           Cisco Systems
Expires: January 2, 2019                                    July 1, 2018

    Flexible Algorithm Definition Advertisement with BGP Link-State
                  draft-ketant-idr-bgp-ls-flex-algo-00

Abstract

   Flexible Algorithm is a solution that allows routing protocols (viz.
   OSPF and IS-IS) to compute paths over a network based on user-defined
   (and hence, flexible) constraints and metrics.  The computation is
   performed by routers participating in the specific network in a
   distribute manner using a Flex Algorithm definition.  This definition
   provisioned on one or more routers and propagated (viz.  OSPF and IS-
   IS flooding) through the network.

   BGP Link-State (BGP-LS) enables the collection of various topology
   information from the network.  This draft defines extensions to BGP-
   LS address-family to advertise the Flexible Algorithm Definition as a
   part of the topology information from the network.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

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 January 2, 2019.

Talaulikar & Psenak      Expires January 2, 2019                [Page 1]
Internet-Draft       BGP-LS Extensions for Flex Algo           July 2018

Copyright Notice

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

   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.  BGP-LS Extensions for Flex Algo Definition  . . . . . . . . .   4
     2.1.  Flex Algo Exclude Any Affinity  . . . . . . . . . . . . .   5
     2.2.  Flex Algo Include Any Affinity  . . . . . . . . . . . . .   6
     2.3.  Flex Algo Include All Affinity  . . . . . . . . . . . . .   6
   3.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   7
   4.  Manageability Considerations  . . . . . . . . . . . . . . . .   7
     4.1.  Operational Considerations  . . . . . . . . . . . . . . .   8
     4.2.  Management Considerations . . . . . . . . . . . . . . . .   8
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   8
   6.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   8
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   8
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .   8
     7.2.  Informative References  . . . . . . . . . . . . . . . . .   9
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   9

1.  Introduction

   IGP protocols (OSPF and IS-IS) traditionally compute best paths over
   the network based on the IGP metric assigned to the links.  Many
   network deployments use RSVP-TE [RFC3209] based or Segment Routing
   (SR) Policy [I-D.ietf-spring-segment-routing-policy] based solutions
   to enforce traffic over a path that is computed using different
   metrics or constraints than the shortest IGP path.
   [I-D.ietf-lsr-flex-algo] defines the Flexible Algorithm solution that
   allows IGPs themselves to compute constraint based paths over the
   network.

   Flexible Algorithm is called so as it allows a user the flexibility
   to define

Talaulikar & Psenak      Expires January 2, 2019                [Page 2]
Internet-Draft       BGP-LS Extensions for Flex Algo           July 2018

   o  the type of calculation to be used (e.g. shortest path)

   o  the metric type to be used (e.g.  IGP metric or TE metric)