Advertisement of Algorithm in BGP
draft-lp-lsr-bgp-algorithm-00

Document Type Active Internet-Draft (individual)
Authors Liu Yao  , Shaofu Peng 
Last updated 2021-03-29
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)
IDR Working Group                                                 Y. Liu
Internet-Draft                                              Shaofu. Peng
Intended status: Standards Track                         ZTE Corporation
Expires: September 30, 2021                               March 29, 2021

                   Advertisement of Algorithm in BGP
                     draft-lp-lsr-bgp-algorithm-00

Abstract

   This document proposes extensions to BGP to support algorithm-based
   end-to-end path establishment.

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 September 30, 2021.

Copyright Notice

   Copyright (c) 2021 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.

Liu & Peng             Expires September 30, 2021               [Page 1]
Internet-Draft              Algorithm in BGP                  March 2021

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Conventions used in this document . . . . . . . . . . . . . .   2
     2.1.  Requirements Language . . . . . . . . . . . . . . . . . .   2
   3.  Algorithm Extended Community  . . . . . . . . . . . . . . . .   2
   4.  Algo-based Inter-domain Path  . . . . . . . . . . . . . . . .   3
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   4
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   4
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   5
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .   5
     7.2.  Informative References  . . . . . . . . . . . . . . . . .   5
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   6

1.  Introduction

   [I-D.ietf-lsr-flex-algo] proposes a solution that allows IGPs
   themselves to compute constraint-based paths over the SR network.
   [I-D.ietf-lsr-ip-flexalgo] allows flex-algo to be deployed in any IP
   network, even in the absence of SR-MPLS and SRv6.

   However, the algorithm-based path can only be used in the IGP domain.
   In the BGP-based inter-domain scenario, end-to-end path based on
   algorithms cannot be supported.

   This document proposes extensions to BGP to support algorithm-based
   end-to-end path establishment.

2.  Conventions used in this document

2.1.  Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in BCP
   14 [RFC2119] [RFC8174] when, and only when, they appear in all
   capitals, as shown here.

3.  Algorithm Extended Community

   This document defines a new transitive BGP Extended Communities
   Attribute[RFC4360].  This new Extended Community has the following
   encoding, where:

Liu & Peng             Expires September 30, 2021               [Page 2]
Internet-Draft              Algorithm in BGP                  March 2021

    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=0x03    | Sub-Type=TBA1 |     Flags     |   Algorithm   |
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
   ~                         Reserved (4 Octets)                   ~
   +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

                  Figure 1: Algorithm Extended Community

      Type: 1 octet.  The value is 0x03.

      Sub-Type: 1 octet.  TBA1

      Flags: 1 octet.  Unused, MUST be set to 0 and ingored on receipt.

      Algorithm: 1 octet specifying IGP Algorithm Types.  Value from 0
      to 255.

      Reserved: 4 Octets.  MUST be set to 0, ignored at reception
Show full document text