BGP Shortest Path Routing Extension Implementation Report

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 8 December 2023.¶

Copyright Notice

Copyright (c) 2023 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 Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶

Table of Contents

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.¶

This document provides an implementation report of the Shortest Path Routing extensions to BGP protocol as specified in [I-D.ietf-lsvr-bgp-spf].¶

The authors did not verify the accuracy of the information provided by respondents or by any alternative means. The respondents are experts with the implementations they reported on, and their responses are considered authoritative for the implementations for which their responses represent. Respondents were asked to only use the "YES" answer if the feature had at least been tested in the lab.¶

2. Implementation Forms

Contact and implementation information for person filling out this form:¶

    ArcOS
        Name: Pushpasis Sarkar
        Email: pushpasis@arrcus.com
        Vendor: Arrcus, Inc.
        Release: ArcOS
        Protocol Role: Route Reflector and Client

    FRR
        Name: Basil Saji
        Email: sajibasil@gmail.com
        Vendor: FRR
        Release:
        Protocol Role: Route Reflector

        Name: Santosh P K
        Email: santosh.pallagatti@gmail.com
        Vendor: FRR
        Release:
        Protocol Role: Route Reflector

3. BGP-LS-SPF Peering Models

Does the implementation support the following BGP-LS-SPF Peering Models as specified in Section 2 of [I-D.ietf-lsvr-bgp-spf]?¶

• 2.1 -- BGP Single-Hop Peering on Network Node Connections¶
• 2.2 -- BGP Peering Between Directly Connected Network Nodes¶
• 2.3 -- BGP Peering in Route-Reflector or Controller Topology¶

4. Extensions to BGP-LS

Does the implementation support the following BGP-LS-SPF TLVs as described in Section 4 and sub-sections of [I-D.ietf-lsvr-bgp-spf]??¶

• T1 -- Node NLRI Attribute SPF Capability TLV¶
• T2 -- Node/Link/Prefix NLRI Attribute SPF Status TLV¶
• T3 -- Link NLRI Attribute IPv4 Prefix-Length TLV¶
• T4 -- Link NLRI Attribute IPv6 Prefix-Length TLV¶
• T5 -- Attribute Sequence-Number TLV¶

5. Support for Simplified Decision Process

Does the implementation support the following Best Path Decision processes as described in Section 5 and sub-sections of [I-D.ietf-lsvr-bgp-spf]?¶

• P1 -- Phase-1 BGP NLRI Selection¶
• P2 -- Dual Stack Support¶
• P3 -- SPF Calculation based on BGP-LS NLRI¶

6. Acknowledgements

TBA¶

7. IANA Considerations

N/A. - No protocol changes are proposed in this document.¶

8. Security Considerations

This document does not introduce any change in any of the protocol specifications.¶

Authors' Addresses