BGP Shortest Path Routing Extension Implementation Report
draft-psarkar-lsvr-bgp-spf-impl-00

Document Type Active Internet-Draft (individual)
Last updated 2020-06-02
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)
Network Working Group                                     P. Sarkar, Ed.
Internet-Draft                                                  K. Patel
Intended status: Informational                              Arrcus, Inc.
Expires: December 4, 2020                                  S. Pallagatti
                                                                  VMware
                                                                 B. Saji
                                                         Arista Networks
                                                            June 2, 2020

       BGP Shortest Path Routing Extension Implementation Report
                   draft-psarkar-lsvr-bgp-spf-impl-00

Abstract

   This document is an implementation report for the Shortest Path
   Routing Extensions to BGP protocol as defined in
   [I-D.ietf-lsvr-bgp-spf].  The authors did not verify the accuracy of
   the information provided by respondents.  The respondents are experts
   with the implementations they reported on, and their responses are
   considered authoritative for the implementations for which their
   responses represent.  The respondents were asked to only use the
   "YES" answer if the feature had at least been tested in the lab.

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 December 4, 2020.

Sarkar, et al.          Expires December 4, 2020                [Page 1]
Internet-Draft        BGP SPF Implementation Report            June 2020

Copyright Notice

   Copyright (c) 2020 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.  Implementation Forms  . . . . . . . . . . . . . . . . . . . .   3
   3.  BGP-LS-SPF Peering Models . . . . . . . . . . . . . . . . . .   3
   4.  Extensions to BGP-LS  . . . . . . . . . . . . . . . . . . . .   4
   5.  Support for Simplified Decision Process . . . . . . . . . . .   4
   6.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   5
   7.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   5
   8.  Security Considerations . . . . . . . . . . . . . . . . . . .   5
   9.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   5
     9.1.  Normative References  . . . . . . . . . . . . . . . . . .   5
     9.2.  Informative References  . . . . . . . . . . . . . . . . .   6
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   6

1.  Introduction

   [I-D.ietf-lsvr-bgp-spf] describes an alternative solution which
   leverages BGP-LS [RFC7752] and the Shortest Path First algorithm
   similar to Internal Gateway Protocols (IGPs) such as OSPF [RFC2328].
   The solution introduces an new BGP-LS-SPF AFI-SAFI and replaces the
   Phase 1 and 2 decision functions of the Decision Process specifed by
   [RFC4271] with the Shortest Path First (SPF) algorithm also known as
   the Dijkstra algorithm.  This solution avails the benefits of both
   BGP and SPF-based IGPs that include TCP based flow-control, no
   periodic link-state refresh, and completely incremental NLRI
   advertisements.  These advantages can reduce the overhead in MSDCs
   where there is a high degree of Equal Cost Multi- Path (ECMPs) and
   the topology is very stable.  Additionally, using an SPF-based
   computation can support fast convergence and the computation of Loop-
   Free Alternatives (LFAs) [RFC5286] in the event of link failures.

Sarkar, et al.          Expires December 4, 2020                [Page 2]
Show full document text