Internet-Draft | BGP-LS extensions for IP Flexible Algori | March 2023 |
Hegde, et al. | Expires 14 September 2023 | [Page] |
Flexible Algorithm is a mechanism that allows Link state 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 distributed manner using a Flexible Algorithm definition. This definition provisioned on one or more routers and propagated (viz. OSPF and IS- IS flooding) through the network. IP Flex-algo enables these constraint based paths to be built in a network which is purely IP and does not support MPLS or SRv6 forwarding plane. 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 bandwidth, delay and metric related constraints in Flexible algorithm definition. It also defines BGP-LS extensions required to advertise IP flexible algorithm related extensions in BGP-LS.¶
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].¶
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 14 September 2023.¶
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.¶
Flexible Algorithm [RFC9350] is defined as a set of parameters consisting of calculation-type, metric-type and a set of constraints for allowing operators to have more control over the network path computation. [I-D.ietf-lsr-flex-algo-bw-con] defines further extensions to Flexible Algorithm that will allow operators additional control over their traffic flow, especially with respect to constraints about metric, delay and bandwidth.¶
[I-D.ietf-lsr-ip-flexalgo] enables constraint based paths to be built in a network which is purely IP and does not support MPLS or SRv6 forwarding plane.¶
This document defines BGP-LS related extensions to carry the information specific to Flexible Algorithms delay and bandwidth constraints as well as extensions related to IP Flexible-Algorithms.¶
Generic Metric as defined in [I-D.ietf-lsr-flex-algo-bw-con] is advertised as a Link attribute [RFC7752]. The Generic Metric may be either sourced from ISIS, OSPFv2 or OSPFv3. When the Generic Metric is sourced from below TLVs in ISIS¶
OR¶
is sourced from below TLVs in OSPF¶
It is advertised as link attribute TLV.¶
When the Generic Metric is sourced from below TLV in ISIS and OSPF¶
It is advertised as a sub-TLV of Application Specific Link Attributes TLV [I-D.ietf-idr-bgp-ls-app-specific-attr]¶
The sub-TLVs described in this section are advertised as the sub-TLV of the Flexible Algorithm Definition TLV [RFC9351].¶
These sub-TLVs are either sourced from ISIS, OSPF or OSPFv3 as described in [I-D.ietf-lsr-flex-algo-bw-con]¶
BGP-LS IP algorithm TLV is a node Attribute TLV and is encoded along with the Node NLRI. The TLV may be sourced from ISIS and/or OSPF as defined in section 5.1 and 5.2 of [I-D.ietf-lsr-ip-flexalgo] .¶
The IP algorithm Prefix Reachability TLV is advertised as a Prefix Attribute and may be associated with an IPv4 or an IPv6 Prefix. This TLV MUST appear only once in a Prefix NLRI. If the IP algorithm Prefix Reachability TLV is present, Prefix Metric TLV MUST NOT be added. IP algorithm Prefix Reachability TLV is present, IGP Flags TLV carries the flags for IP algorithm Prefix Reachability TLV.¶
BGP-LS NLRI and Attribute TLV registry is updated to include newly defined Node, link and prefix attriute TLVs.¶