Cisco Systems, Inc.

Apollo Business Center Mlynske nivy 43 Bratislava 82109 Slovakia ppsenak@cisco.com

Juniper Networks, Inc.

Embassy Business Park Bangalore KA 560093 India shraddha@juniper.net

Cisco Systems, Inc.

Brussels Belgium cfilsfil@cisco.com

Cisco Systems, Inc

India ketant.ietf@gmail.com

Edward Jones

arkadiy.gulko@edwardjones.com

rtg lsr IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.

Status of This Memo This is an Internet Standards Track document. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at .

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 () 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

• .  Introduction
• .  Requirements Language
• .  Terminology
• .  Flexible Algorithm
• .  Flexible Algorithm Definition Advertisement
  • .  IS-IS Flexible Algorithm Definition Sub-TLV
  • .  OSPF Flexible Algorithm Definition TLV
  • .  Common Handling of the Flexible Algorithm Definition TLV
• .  Sub-TLVs of IS-IS FAD Sub-TLV
  • .  IS-IS Flexible Algorithm Exclude Admin Group Sub-TLV
  • .  IS-IS Flexible Algorithm Include-Any Admin Group Sub-TLV
  • .  IS-IS Flexible Algorithm Include-All Admin Group Sub-TLV
  • .  IS-IS Flexible Algorithm Definition Flags Sub-TLV
  • .  IS-IS Flexible Algorithm Exclude SRLG Sub-TLV
• .  Sub-TLVs of the OSPF FAD TLV
  • .  OSPF Flexible Algorithm Exclude Admin Group Sub-TLV
  • .  OSPF Flexible Algorithm Include-Any Admin Group Sub-TLV
  • .  OSPF Flexible Algorithm Include-All Admin Group Sub-TLV
  • .  OSPF Flexible Algorithm Definition Flags Sub-TLV
  • .  OSPF Flexible Algorithm Exclude SRLG Sub-TLV
• .  IS-IS Flexible Algorithm Prefix Metric Sub-TLV
• .  OSPF Flexible Algorithm Prefix Metric Sub-TLV
• . OSPF Flexible Algorithm ASBR Reachability Advertisement
  • .  OSPFv2 Extended Inter-Area ASBR LSA
    • .  OSPFv2 Extended Inter-Area ASBR TLV
  • .  OSPF Flexible Algorithm ASBR Metric Sub-TLV
• . Advertisement of Node Participation in a Flex-Algorithm
  • .  Advertisement of Node Participation for Segment Routing
  • .  Advertisement of Node Participation for Other Data Planes
• . Advertisement of Link Attributes for Flex-Algorithm
• . Calculation of Flexible Algorithm Paths
  • .  Multi-area and Multi-domain Considerations
• . Flex-Algorithm and Forwarding Plane
  • .  Segment Routing MPLS Forwarding for Flex-Algorithm
  • .  SRv6 Forwarding for Flex-Algorithm
  • .  Other Data Planes' Forwarding for Flex-Algorithm
• . Operational Considerations
  • .  Inter-area Considerations
  • .  Usage of the SRLG Exclude Rule with Flex-Algorithm
  • .  Max-Metric Consideration
  • .  Flexible Algorithm Definition and Changes
  • .  Number of Flex-Algorithms
• . Backward Compatibility
• . Security Considerations
• . IANA Considerations
  • .  IGP IANA Considerations
    • .  IGP Algorithm Types Registry
    • .  IGP Metric-Type Registry
  • .  IGP Flexible Algorithm Definition Flags Registry
  • .  IS-IS IANA Considerations
    • .  IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV Registry
    • .  IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability Registry
    • .  IS-IS Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV Registry
  • .  OSPF IANA Considerations
    • .  OSPF Router Information (RI) TLVs Registry
    • .  OSPFv2 Extended Prefix TLV Sub-TLVs Registry
    • .  OSPFv3 Extended-LSA Sub-TLVs Registry
    • .  OSPF Flex-Algorithm Prefix Metric Bits Registry
    • .  Opaque Link-State Advertisements (LSA) Option Types Registry
    • .  OSPFv2 Extended Inter-Area ASBR TLVs Registry
    • .  OSPFv2 Extended Inter-Area ASBR Sub-TLVs Registry
    • .  OSPF Flexible Algorithm Definition TLV Sub-TLVs Registry
    • .  Link Attribute Application Identifiers Registry
• . References
  • .  Normative References
  • .  Informative References
• Acknowledgements
• Authors' Addresses

Introduction An IGP-computed path based on the shortest IGP metric is often replaced by a traffic-engineered path due to requirements that are not reflected by the IGP metric. Some networks engineer the IGP metric assignments in a way that the IGP metric reflects the link bandwidth or delay. If, for example, the IGP metric reflects the bandwidth on the link and user traffic is delay sensitive, the best IGP path may not reflect the best path from such a user's perspective. To overcome this limitation, various sorts of Traffic Engineering have been deployed, including RSVP-TE and SR-TE, in which case the TE component is responsible for computing paths based on additional metrics and/or constraints. Such paths need to be installed in the forwarding tables in addition to, or as a replacement for, the original paths computed by IGPs. Tunnels are often used to represent the engineered paths and mechanisms, like the one described in , and are used to replace the original IGP paths with such tunnel paths. This document specifies a set of extensions to IS-IS, OSPFv2, and OSPFv3 that enable a router to advertise TLVs that (a) identify a calculation-type, (b) specify a metric-type, and (c) describe a set of constraints on the topology that are to be used to compute the best paths along the constrained topology. A given combination of calculation-type, metric-type, and constraints is known as a "Flexible Algorithm Definition". A router that sends such a set of TLVs also assigns a Flex-Algorithm value to the specified combination of calculation-type, metric-type, and constraints. This document also specifies a way for a router to use IGPs to associate one or more Segment Routing with the MPLS Data Plane (SR-MPLS) Prefix-SIDs or Segment Routing over IPv6 (SRv6) locators with a particular Flex-Algorithm. Each such Prefix-SID or SRv6 locator then represents a path that is computed according to the identified Flex-Algorithm. In SRv6, it is the locator, not the Segment Identifier (SID), that holds the binding to the algorithm.

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 when, and only when, they appear in all capitals, as shown here.

Terminology This section defines terms that are often used in this document.

Flexible Algorithm Definition (FAD):

the set consisting of (a) a calculation-type, (b) a metric-type, and (c) a set of constraints.

Flex-Algorithm:

a numeric identifier in the range 128-255 that is associated via configuration with the Flexible Algorithm Definition.

Flexible Algorithm Participation:

per the data plane configuration state that expresses whether the node is participating in a particular Flexible Algorithm. Not all routers in a given network need to participate in a given Flexible Algorithm. The Flexible Algorithm(s) that a given router participates in is determined by configuration.

IGP Algorithm:

value from the IANA "IGP Algorithm Types" registry defined under the "Interior Gateway Protocol (IGP) Parameters" registry group. IGP Algorithms represent the triplet (calculation-type, metric-type, and constraints), where the second and third elements of the triplet MAY be unspecified.

ABR:

Area Border Router. In IS-IS terminology, it is also known as the Level 1 (L1) / Level 2 (L2) router.

ASBR:

Autonomous System Border Router.

Flexible Algorithm Many possible constraints may be used to compute a path over a network. Some networks are deployed as multiple planes. A simple form of constraint may be to use a particular plane. A more sophisticated form of constraint can include some extended metric, as described in . Constraints that restrict paths to links with specific affinities or avoid links with specific affinities are also possible. Combinations of these are also possible. To provide maximum flexibility, a mechanism is provided that allows a router to identify a particular calculation-type and metric-type, describe a particular set of constraints, and assign a numeric identifier, referred to as Flex-Algorithm, to the combination of that calculation-type, metric-type, and those constraints. The mapping between the Flex-Algorithm and its meaning is flexible and defined by the user. As long as all routers in the domain have a common understanding as to what a particular Flex-Algorithm represents, the resulting routing computation is consistent and traffic is not subject to any looping. The set consisting of (a) a calculation-type, (b) a metric-type, and (c) a set of constraints is referred to as a Flexible Algorithm Definition. The Flex-Algorithm is a numeric identifier in the range 128-255 that is associated via configuration with the Flexible Algorithm Definition. The IANA "IGP Algorithm Types" registry defines the set of values for IGP Algorithms. The following values are allocated by IANA from this registry for Flex-Algorithms: 128-255 - Flex-Algorithms

Flexible Algorithm Definition Advertisement To guarantee loop-free forwarding for paths computed for a particular Flex-Algorithm, all routers that (a) are configured to participate in a particular Flex-Algorithm and (b) are in the same Flex-Algorithm Definition advertisement scope MUST agree on the definition of the Flex-Algorithm. The following procedures ensure this condition is fulfilled.

IS-IS Flexible Algorithm Definition Sub-TLV The IS-IS Flexible Algorithm Definition (FAD) sub-TLV is used to advertise the definition of the Flex-Algorithm. The IS-IS FAD sub-TLV is advertised as a sub-TLV of the IS-IS Router CAPABILITY TLV-242, which is defined in . The IS-IS FAD sub-TLV has the following format: 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 | Length |Flex-Algorithm | Metric-Type | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Calc-Type | Priority | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Sub-TLVs | + + | ... | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

26

Length:

variable number of octets, dependent on the included sub-TLVs.

Flex-Algorithm:

Flexible Algorithm number. Single octet value between 128 and 255 inclusive.

Metric-Type:

type of metric from the IANA "IGP Metric-Type" registry () to be used during the calculation. The following values are defined:

0:

IGP Metric

1:

Min Unidirectional Link Delay, as defined in , encoded as an application-specific link attribute, as specified in and of this document.

2:

Traffic Engineering Default Metric, as defined in , encoded as an application-specific link attribute, as specified in and of this document.

Calc-Type:

calculation-type. Value from 0-127 inclusive from the IANA "IGP Algorithm Types" registry defined under the "Interior Gateway Protocol (IGP) Parameters" registry. IGP Algorithms in the range of 0-127 have a defined triplet (calculation-type, metric-type, constraints). When used to specify the calculation-type in the FAD sub-TLV, only the calculation-type defined for the specified IGP Algorithm is used. The Metric/Constraints MUST NOT be inherited. If the required calculation-type is Shortest Path First, the value 0 MUST appear in this field.

Priority:

value between 0 and 255 inclusive that specifies the priority of the advertisement. Numerically greater values are preferred. Usage of the priority is described in .

Sub-TLVs:

optional sub-TLVs.

The IS-IS FAD sub-TLV MAY be advertised in a Label Switched Path (LSP) of any number. The IS-IS router MAY advertise more than one IS-IS FAD sub-TLV for a given Flexible Algorithm (see ). The IS-IS FAD sub-TLV has an area/level scope. The Router Capability TLV in which the FAD sub-TLV is present MUST have the S bit clear. An IS-IS L1/L2 router MAY be configured to regenerate the winning FAD from level 2, without any modification to it, to the level 1 area. The regeneration of the FAD sub-TLV from level 2 to level 1 is determined by the L1/L2 router, not by the originator of the FAD advertisement in level 2. In such a case, the regenerated FAD sub-TLV will be advertised in the level 1 Router Capability TLV originated by the L1/L2 router. An L1/L2 router MUST NOT regenerate any FAD sub-TLV from level 1 to level 2.

OSPF Flexible Algorithm Definition TLV The OSPF FAD TLV is advertised as a top-level TLV of the Router Information (RI) Link State Advertisement (LSA), which is defined in . The OSPF FAD TLV has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Flex-Algorithm | Metric-Type | Calc-Type | Priority | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Sub-TLVs | + + | ... | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

16

Length:

variable number of octets, dependent on the included sub-TLVs.

Flex-Algorithm:

Flexible Algorithm number. Single octet value between 128 and 255 inclusive.

Metric-Type:

type of metric from the IANA "IGP Metric-Type" registry () to be used during the calculation. The following values are defined:

0:

IGP Metric

1:

Min Unidirectional Link Delay, as defined in , encoded as an application-specific link attribute, as specified in and of this document.

2:

Traffic Engineering Metric, as defined in , encoded as an application-specific link attribute, as specified in and of this document.

Calc-Type:

as described in .

Priority:

as described in .

Sub-TLVs:

optional sub-TLVs.

When multiple OSPF FAD TLVs, for the same Flexible Algorithm, are received from a given router, the receiver MUST use the first occurrence of the TLV in the RI LSA. If the OSPF FAD TLV, for the same Flex-Algorithm, appears in multiple RI LSAs that have different flooding scopes, the OSPF FAD TLV in the RI LSA with the area-scoped flooding scope MUST be used. If the OSPF FAD TLV, for the same algorithm, appears in multiple RI LSAs that have the same flooding scope, the OSPF FAD TLV in the RI LSA with the numerically smallest Instance ID MUST be used and subsequent instances of the OSPF FAD TLV MUST be ignored. The RI LSA can be advertised at any of the defined opaque flooding scopes (link, area, or Autonomous System (AS)). For the purpose of OSPF FAD TLV advertisement, area-scoped flooding is REQUIRED. The AS flooding scope SHOULD NOT be used unless local configuration policy on the originating router indicates domain-wide flooding.

Common Handling of the Flexible Algorithm Definition TLV This section describes the protocol-independent handling of the FAD TLV (OSPF) or FAD sub-TLV (IS-IS). We will refer to it as FAD TLV in this section, even though, in the case of IS-IS, it is a sub-TLV. The value of the Flex-Algorithm MUST be between 128 and 255 inclusive. If it is not, the FAD TLV MUST be ignored. Only a subset of the routers participating in the particular Flex-Algorithm need to advertise the definition of the Flex-Algorithm. Every router that is configured to participate in a particular Flex-Algorithm MUST select the Flex-Algorithm Definition based on the following ordered rules. This allows for the consistent Flex-Algorithm Definition selection in cases where different routers advertise different definitions for a given Flex-Algorithm:

1. From the advertisements of the FAD in the area (including both locally generated advertisements and received advertisements), select the one(s) with the numerically greatest priority value.
2. If there are multiple advertisements of the FAD with the same numerically greatest priority, select the one that is originated from the router with the numerically greatest System-ID, in the case of IS-IS, or Router ID, in the case of OSPFv2 and OSPFv3. For IS-IS, the System-ID is described in . For OSPFv2 and OSPFv3, the standard Router ID is described in and , respectively.

The FAD selected according to these rules is also known as the "winning FAD". A router that is not configured to participate in a particular Flex-Algorithm MUST ignore FAD sub-TLV advertisements for such Flex-Algorithm. A router that is not participating in a particular Flex-Algorithm MAY advertise the FAD for such Flex-Algorithm. Receiving routers MUST consider a received FAD advertisement regardless of the Flex-Algorithm participation of that FAD advertisement's originator. Any change in the Flex-Algorithm Definition may result in a temporary disruption of traffic that is forwarded based on such Flex-Algorithm paths. The impact is similar to any other event that requires network-wide convergence. If a node is configured to participate in a particular Flexible Algorithm, but there is no valid Flex-Algorithm Definition available for it or the selected Flex-Algorithm Definition includes calculation-type, metric-type, constraint, flag, or sub-TLV that is not supported by the node, it MUST stop participating in such Flexible Algorithm. That implies that it MUST NOT announce participation for such Flexible Algorithm, as specified in , and it MUST remove any forwarding state associated with it. The Flex-Algorithm Definition is topology independent. It applies to all topologies that a router participates in.

Sub-TLVs of IS-IS FAD Sub-TLV One of the limitations of IS-IS is that the length of a TLV/sub-TLV is limited to a maximum of 255 octets. For the FAD sub-TLV, there are a number of sub-sub-TLVs (defined below) that are supported. For a given Flex-Algorithm, it is possible that the total number of octets required to completely define a FAD exceeds the maximum length supported by a single FAD sub-TLV. In such cases, the FAD MAY be split into multiple such sub-TLVs, and the content of the multiple FAD sub-TLVs are combined to provide a complete FAD for the Flex-Algorithm. In such a case, the fixed portion of the FAD (see ) MUST be identical in all FAD sub-TLVs for a given Flex-Algorithm from a given IS. In case the fixed portion of such FAD sub-TLVs differ, the values in the fixed portion in the FAD sub-TLV in the first occurrence in the lowest-numbered LSP from a given IS MUST be used. Any specification that introduces a new IS-IS FAD sub-sub-TLV MUST specify whether the FAD sub-TLV may appear multiple times in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS and how to handle them if multiple are allowed.

IS-IS Flexible Algorithm Exclude Admin Group Sub-TLV The Flexible Algorithm Definition can specify "colors" that are used by the operator to exclude links during the Flex-Algorithm path computation. The IS-IS Flexible Algorithm Exclude Admin Group (FAEAG) sub-TLV is used to advertise the exclude rule that is used during the Flex-Algorithm path calculation, as specified in . The IS-IS FAEAG sub-TLV is a sub-TLV of the IS-IS FAD sub-TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

1

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The IS-IS FAEAG sub-TLV MUST NOT appear more than once in a single IS-IS FAD sub-TLV. If it appears more than once, the IS-IS FAD sub-TLV MUST be ignored by the receiver. The IS-IS FAEAG sub-TLV MUST NOT appear more than once in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS. If it appears more than once in such a set, the IS-IS FAEAG sub-TLV in the first occurrence in the lowest-numbered LSP from a given IS MUST be used, and any other occurrences MUST be ignored.

IS-IS Flexible Algorithm Include-Any Admin Group Sub-TLV The Flexible Algorithm Definition can specify "colors" that are used by the operator to include links during the Flex-Algorithm path computation. The IS-IS Flexible Algorithm Include-Any Admin Group sub-TLV is used to advertise the include-any rule that is used during the Flex-Algorithm path calculation, as specified in . The IS-IS Flexible Algorithm Include-Any Admin Group sub-TLV is a sub-TLV of the IS-IS FAD sub-TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

2

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The IS-IS Flexible Algorithm Include-Any Admin Group sub-TLV MUST NOT appear more than once in a single IS-IS FAD sub-TLV. If it appears more than once, the IS-IS FAD sub-TLV MUST be ignored by the receiver. The IS-IS Flexible Algorithm Include-Any Admin Group sub-TLV MUST NOT appear more than once in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS. If it appears more than once in such a set, the IS-IS Flexible Algorithm Include-Any Admin Group sub-TLV in the first occurrence in the lowest-numbered LSP from a given IS MUST be used, and any other occurrences MUST be ignored.

IS-IS Flexible Algorithm Include-All Admin Group Sub-TLV The Flexible Algorithm Definition can specify "colors" that are used by the operator to include links during the Flex-Algorithm path computation. The IS-IS Flexible Algorithm Include-All Admin Group sub-TLV is used to advertise the include-all rule that is used during the Flex-Algorithm path calculation, as specified in . The IS-IS Flexible Algorithm Include-All Admin Group sub-TLV is a sub-TLV of the IS-IS FAD sub-TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

3

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The IS-IS Flexible Algorithm Include-All Admin Group sub-TLV MUST NOT appear more than once in a single IS-IS FAD sub-TLV. If it appears more than once, the IS-IS FAD sub-TLV MUST be ignored by the receiver. The IS-IS Flexible Algorithm Include-All Admin Group sub-TLV MUST NOT appear more than once in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS. If it appears more than once in such a set, the IS-IS Flexible Algorithm Include-All Admin Group sub-TLV in the first occurrence in the lowest-numbered LSP from a given IS MUST be used, and any other occurrences MUST be ignored.

IS-IS Flexible Algorithm Definition Flags Sub-TLV The IS-IS Flexible Algorithm Definition Flags (FADF) sub-TLV is a sub-TLV of the IS-IS FAD sub-TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flags | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

4

Length:

variable, number of octets of the Flags field.

Flags:

0 1 2 3 4 5 6 7... +-+-+-+-+-+-+-+-+... |M| | | ... +-+-+-+-+-+-+-+-+...

M-flag:

when set, the Flex-Algorithm-specific prefix metric MUST be used for inter-area and external prefix calculation. This flag is not applicable to prefixes advertised as SRv6 locators.

A new IANA "IGP Flexible Algorithm Definition Flags" registry is defined for allocation of bits in the Flags field -- see . Bits are defined/sent starting with bit 0 defined above. Additional bit definitions that may be defined in the future SHOULD be assigned in ascending bit order to minimize the number of bits that will need to be transmitted. Undefined bits MUST be transmitted as 0. Bits that are not transmitted MUST be treated as if they are set to 0 on receipt. The IS-IS FADF sub-TLV MUST NOT appear more than once in a single IS-IS FAD sub-TLV. If it appears more than once, the IS-IS FAD sub-TLV MUST be ignored by the receiver. The IS-IS FADF sub-TLV MUST NOT appear more than once in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS. If it appears more than once in such a set, the IS-IS FADF sub-TLV in the first occurrence in the lowest-numbered LSP from a given IS MUST be used, and any other occurrences MUST be ignored. If the IS-IS FADF sub-TLV is not present inside the IS-IS FAD sub-TLV, all the bits are assumed to be set to 0. If a node is configured to participate in a particular Flexible Algorithm, but the selected Flex-Algorithm Definition includes a bit in the IS-IS FADF sub-TLV that is not supported by the node, it MUST stop participating in such Flexible Algorithm. New flag bits may be defined in the future. Implementations MUST check all advertised flag bits in the received IS-IS FADF sub-TLV -- not just the subset currently defined. The M-flag MUST not be used when calculating prefix reachability for the SRv6 Locator prefix.

IS-IS Flexible Algorithm Exclude SRLG Sub-TLV The Flexible Algorithm Definition can specify Shared Risk Link Groups (SRLGs) that the operator wants to exclude during the Flex-Algorithm path computation. The IS-IS Flexible Algorithm Exclude SRLG (FAESRLG) sub-TLV is used to advertise the exclude rule that is used during the Flex-Algorithm path calculation, as specified in . The IS-IS FAESRLG sub-TLV is a sub-TLV of the IS-IS FAD sub-TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Shared Risk Link Group Value | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

5

Length:

variable, dependent on number of SRLG values. MUST be a multiple of 4 octets.

Shared Risk Link Group Value:

SRLG value, as defined in .

The IS-IS FAESRLG sub-TLV MUST NOT appear more than once in a single IS-IS FAD sub-TLV. If it appears more than once, the IS-IS FAD sub-TLV MUST be ignored by the receiver. The IS-IS FAESRLG sub-TLV MAY appear more than once in the set of FAD sub-TLVs for a given Flex-Algorithm from a given IS. This may be necessary in cases where the total number of SRLG values that are specified cause the FAD sub-TLV to exceed the maximum length of a single FAD sub-TLV. In such a case, the receiver MUST use the union of all values across all IS-IS FAESRLG sub-TLVs from such set.

Sub-TLVs of the OSPF FAD TLV

OSPF Flexible Algorithm Exclude Admin Group Sub-TLV The OSPF Flexible Algorithm Exclude Admin Group (FAEAG) sub-TLV is a sub-TLV of the OSPF FAD TLV. Its usage is described in . It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

1

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The OSPF FAEAG sub-TLV MUST NOT appear more than once in an OSPF FAD TLV. If it appears more than once, the OSPF FAD TLV MUST be ignored by the receiver.

OSPF Flexible Algorithm Include-Any Admin Group Sub-TLV The OSPF Flexible Algorithm Include-Any Admin Group sub-TLV is a sub-TLV of the OSPF FAD TLV. The usage of this sub-TLV is described in . It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

2

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The OSPF Flexible Algorithm Include-Any Admin Group sub-TLV MUST NOT appear more than once in an OSPF FAD TLV. If it appears more than once, the OSPF FAD TLV MUST be ignored by the receiver.

OSPF Flexible Algorithm Include-All Admin Group Sub-TLV The OSPF Flexible Algorithm Include-All Admin Group sub-TLV is a sub-TLV of the OSPF FAD TLV. The usage of this sub-TLV is described in . It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Extended Admin Group | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

3

Length:

variable, dependent on the size of the Extended Admin Group. MUST be a multiple of 4 octets.

Extended Administrative Group:

Extended Administrative Group, as defined in .

The OSPF Flexible Algorithm Include-All Admin Group sub-TLV MUST NOT appear more than once in an OSPF FAD TLV. If it appears more than once, the OSPF FAD TLV MUST be ignored by the receiver.

OSPF Flexible Algorithm Definition Flags Sub-TLV The OSPF Flexible Algorithm Definition Flags (FADF) sub-TLV is a sub-TLV of the OSPF FAD TLV. It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flags | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

4

Length:

variable, dependent on the size of the Flags field. MUST be a multiple of 4 octets.

Flags:

0 1 2 3 4 5 6 7... +-+-+-+-+-+-+-+-+... |M| | | ... +-+-+-+-+-+-+-+-+...

M-flag:

when set, the Flex-Algorithm-specific prefix and ASBR metric MUST be used for inter-area and external prefix calculation. This flag is not applicable to prefixes advertised as SRv6 locators.

A new IANA "IGP Flexible Algorithm Definition Flags" registry is defined for allocation of bits in the Flags field -- see . Bits are defined/sent starting with bit 0 defined above. Additional bit definitions that may be defined in the future SHOULD be assigned in ascending bit order to minimize the number of bits that will need to be transmitted. Undefined bits MUST be transmitted as 0. Bits that are not transmitted MUST be treated as if they are set to 0 on receipt. The OSPF FADF sub-TLV MUST NOT appear more than once in an OSPF FAD TLV. If it appears more than once, the OSPF FAD TLV MUST be ignored by the receiver. If the OSPF FADF sub-TLV is not present inside the OSPF FAD TLV, all the bits are assumed to be set to 0. If a node is configured to participate in a particular Flexible Algorithm, but the selected Flex-Algorithm Definition includes a bit in the OSPF FADF sub-TLV that is not supported by the node, it MUST stop participating in such Flexible Algorithm. New flag bits may be defined in the future. Implementations MUST check all advertised flag bits in the received OSPF FADF sub-TLV -- not just the subset currently defined. The M-flag MUST not be used when calculating prefix reachability for the SRv6 Locator prefix.

OSPF Flexible Algorithm Exclude SRLG Sub-TLV The OSPF Flexible Algorithm Exclude SRLG (FAESRLG) sub-TLV is a sub-TLV of the OSPF FAD TLV. Its usage is described in . It has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Shared Risk Link Group Value | +- -+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

5

Length:

variable, dependent on the number of SRLGs. MUST be a multiple of 4 octets.

Shared Risk Link Group Value:

SRLG value, as defined in .

The OSPF FAESRLG sub-TLV MUST NOT appear more than once in an OSPF FAD TLV. If it appears more than once, the OSPF FAD TLV MUST be ignored by the receiver.

IS-IS Flexible Algorithm Prefix Metric Sub-TLV The IS-IS Flexible Algorithm Prefix Metric (FAPM) sub-TLV supports the advertisement of a Flex-Algorithm-specific prefix metric associated with a given prefix advertisement. The IS-IS FAPM sub-TLV is a sub-TLV of TLVs 135, 235, 236, and 237 and has the following format: 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 | Length |Flex-Algorithm | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

6

Length:

5 octets

Flex-Algorithm:

single octet value between 128 and 255 inclusive.

Metric:

4 octets of metric information.

The IS-IS FAPM sub-TLV MAY appear multiple times in its parent TLV. If it appears more than once with the same Flex-Algorithm value, the first instance MUST be used and any subsequent instances MUST be ignored. If a prefix is advertised with a Flex-Algorithm prefix metric larger than MAX_PATH_METRIC, as defined in , this prefix MUST NOT be considered during the Flexible Algorithm computation. The usage of the Flex-Algorithm prefix metric is described in . The IS-IS FAPM sub-TLV MUST NOT be advertised as a sub-TLV of the IS-IS SRv6 Locator TLV . The IS-IS SRv6 Locator TLV includes the Algorithm and Metric fields, which MUST be used instead. If the FAPM sub-TLV is present as a sub-TLV of the IS-IS SRv6 Locator TLV in the received LSP, such FAPM sub-TLV MUST be ignored.

OSPF Flexible Algorithm Prefix Metric Sub-TLV The OSPF Flexible Algorithm Prefix Metric (FAPM) sub-TLV supports the advertisement of a Flex-Algorithm-specific prefix metric associated with a given prefix advertisement. The OSPF FAPM sub-TLV is a sub-TLV of the:

• OSPFv2 Extended Prefix TLV and
• following OSPFv3 TLVs, as defined in :
  • Inter-Area Prefix TLV
  • External-Prefix TLV

The OSPF FAPM sub-TLV has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Flex-Algorithm | Flags | Reserved | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

3 for OSPFv2, and 26 for OSPFv3

Length:

8 octets

Flex-Algorithm:

single octet value between 128 and 255 inclusive.

Flags:

1-octet value 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |E| | +-+-+-+-+-+-+-+-+

E bit:

position 0: The type of external metric. If the bit is set, the metric specified is a Type 2 external metric. This bit is applicable only to OSPF external and Not-So-Stubby Area (NSSA) external prefixes. This is semantically the same as the E bit in and for OSPFv2 and OSPFv3, respectively.

Bits 1 through 7:

MUST be cleared by the originator and ignored by the receiver.

Reserved:

MUST be set to 0 and ignored at reception.

Metric:

4 octets of metric information.

The OSPF FAPM sub-TLV MAY appear multiple times in its parent TLV. If it appears more than once with the same Flex-Algorithm value, the first instance MUST be used and any subsequent instances MUST be ignored. The usage of the Flex-Algorithm prefix metric is described in .

OSPF Flexible Algorithm ASBR Reachability Advertisement An OSPF ABR advertises the reachability of ASBRs in its attached areas to enable routers within those areas to perform route calculations for external prefixes advertised by the ASBRs. OSPF extensions for advertisement of Flex-Algorithm-specific reachability and the metric for ASBRs is similarly required for Flex-Algorithm external prefix computations, as described further in .

OSPFv2 Extended Inter-Area ASBR LSA The OSPFv2 Extended Inter-Area ASBR (EIA-ASBR) LSA is an OSPF Opaque LSA that is used to advertise additional attributes related to the reachability of the OSPFv2 ASBR that is external to the area yet internal to the OSPF domain. Semantically, the OSPFv2 EIA-ASBR LSA is equivalent to the fixed format Type 4 summary-LSA . Unlike the Type 4 summary-LSA, the Link State ID (LSID) of the EIA-ASBR LSA does not carry the ASBR Router ID -- the ASBR Router ID is carried in the body of the LSA. The OSPFv2 EIA-ASBR LSA is advertised by an OSPFv2 ABR, and its flooding is defined to be area-scoped only. An OSPFv2 ABR generates the EIA-ASBR LSA for an ASBR when it is advertising the Type 4 summary-LSA for it and has the need for advertising additional attributes for that ASBR beyond what is conveyed in the fixed-format Type 4 summary-LSA. An OSPFv2 ABR MUST NOT advertise the EIA-ASBR LSA for an ASBR for which it is not advertising the Type 4 summary-LSA. This ensures that the ABR does not generate the EIA-ASBR LSA for an ASBR to which it does not have reachability in the base OSPFv2 topology calculation. The OSPFv2 ABR SHOULD NOT advertise the EIA-ASBR LSA for an ASBR when it does not have additional attributes to advertise for that ASBR. The OSPFv2 EIA-ASBR LSA has the following format: 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | LS Type | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Opaque Type | Opaque ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | +- TLVs -+ | ... | The LS age and Options fields are as defined in . The LS Type MUST be 10, indicating that the Opaque LSA flooding scope is area-local . The Opaque Type used by the OSPFv2 EIA-ASBR LSA is 11. The Opaque Type is used to differentiate the various types of OSPFv2 Opaque LSAs and is described in . The Opaque ID field is an arbitrary value used to maintain multiple OSPFv2 EIA-ASBR LSAs. For OSPFv2 EIA-ASBR LSAs, the Opaque ID has no semantic significance other than to differentiate OSPFv2 EIA-ASBR LSAs originated by the same OSPFv2 ABR. If multiple OSPFv2 EIA-ASBR LSAs specify the same ASBR, the attributes from the Opaque LSA with the lowest Opaque ID SHOULD be used. The Advertising Router, LS sequence number, and LS checksum fields are as defined in . The Length field is as defined in . It represents the total length (in octets) of the Opaque LSA, including the LSA header and all TLVs (including padding). The format of the TLVs within the body of the OSPFv2 EIA-ASBR LSA is the same as the format used by the Traffic Engineering Extensions to OSPFv2 . The variable TLV section consists of one or more nested TLV tuples. Nested TLVs are also referred to as sub-TLVs. The TLV Length field defines the length of the value portion in octets (thus, a TLV with no value portion would have a length of 0). The TLV is padded to 4-octet alignment; padding is not included in the Length field (so a 3-octet value would have a length of 3, but the total size of the TLV would be 8 octets). Nested TLVs are also 32-bit aligned. For example, a 1-octet value would have the Length field set to 1, and 3 octets of padding would be added to the end of the value portion of the TLV. The padding is composed of zeros.

OSPFv2 Extended Inter-Area ASBR TLV The OSPFv2 Extended Inter-Area ASBR (EIA-ASBR) TLV is a top-level TLV of the OSPFv2 EIA-ASBR LSA and is used to advertise additional attributes associated with the reachability of an ASBR. The OSPFv2 EIA-ASBR TLV has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ASBR Router ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ . . . Sub-TLVs . . . +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

1

Length:

variable number of octets.

ASBR Router ID:

4 octets carrying the OSPF Router ID of the ASBR whose information is being carried.

Sub-TLVs:

variable

Only a single OSPFv2 EIA-ASBR TLV MUST be advertised in each OSPFv2 EIA-ASBR LSA, and the receiver MUST ignore all instances of this TLV other than the first one in an LSA. The OSPFv2 EIA-ASBR TLV MUST be present inside an OSPFv2 EIA-ASBR LSA and MUST include at least a single sub-TLV; otherwise, the OSPFv2 EIA-ASBR LSA MUST be ignored by the receiver.

OSPF Flexible Algorithm ASBR Metric Sub-TLV The OSPF Flexible Algorithm ASBR Metric (FAAM) sub-TLV supports the advertisement of a Flex-Algorithm-specific metric associated with a given ASBR reachability advertisement by an ABR. The OSPF FAAM sub-TLV is a sub-TLV of the:

• OSPFv2 Extended Inter-Area ASBR TLV, as defined in , and
• OSPFv3 Inter-Area-Router TLV, as defined in .

The OSPF FAAM sub-TLV has the following format: 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 | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Flex-Algorithm | Reserved | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

where:

Type:

1 for OSPFv2, and 33 for OSPFv3

Length:

8 octets

Flex-Algorithm:

single octet value between 128 and 255 inclusive.

Reserved:

3 octets. MUST be set to 0 and ignored at reception.

Metric:

4 octets of metric information.

The OSPF FAAM sub-TLV MAY appear multiple times in its parent TLV. If it appears more than once with the same Flex-Algorithm value, the first instance MUST be used and any subsequent instances MUST be ignored. The advertisement of the ASBR reachability using the OSPF FAAM sub-TLV inside the OSPFv2 EIA-ASBR LSA follows and inside the OSPFv3 E-Inter-Area-Router-LSA follows . The reachability of the ASBR is evaluated in the context of the specific Flex-Algorithm. The FAAM computed by the ABR will be equal to the metric to reach the ASBR for a given Flex-Algorithm in a source area or the cumulative metric via an ABR(s) when the ASBR is in a remote area. This is similar in nature to how the metric is set when the ASBR reachability metric is computed in the default algorithm for the metric in the OSPFv2 Type 4 ASBR summary-LSA and the OSPFv3 Inter-Area-Router-LSA. An OSPF ABR MUST NOT include the OSPF FAAM sub-TLV with a specific Flex-Algorithm in its reachability advertisement for an ASBR between areas unless that ASBR is reachable for it in the context of that specific Flex-Algorithm. An OSPF ABR MUST include the OSPF FAAM sub-TLVs as part of the ASBR reachability advertisement between areas for any Flex-Algorithm for which the winning FAD includes the M-flag and the ASBR is reachable in the context of that specific Flex-Algorithm. OSPF routers MUST use the OSPF FAAM sub-TLV to calculate the reachability of the ASBRs if the winning FAD for the specific Flex- Algorithm includes the M-flag. OSPF routers MUST NOT use the OSPF FAAM sub-TLV to calculate the reachability of the ASBRs for the specific Flex-Algorithm if the winning FAD for such Flex-Algorithm does not include the M-flag. Instead, the OSPFv2 Type 4 summary-LSAs or the OSPFv3 Inter-Area-Router-LSAs MUST be used, as specified in and for OSPFv2 and OSPFv3, respectively. The processing of a new or changed OSPF FAAM sub-TLV triggers the processing of external routes similar to what is described in for OSPFv2 and for OSPFv3 for the specific Flex-Algorithm. The OSPF external and NSSA external route calculation should be limited to a Flex-Algorithm(s) for which the winning FAD(s) includes the M-flag. Processing of the OSPF FAAM sub-TLV does not require the existence of the equivalent OSPFv2 Type 4 summary-LSA or the OSPFv3 Inter-Area-Router-LSA that is advertised by the same ABR inside the area. The presence of the base LSA is not mandatory for the usage of the extended LSA with the OSPF FAAM sub-TLV.

Advertisement of Node Participation in a Flex-Algorithm When a router is configured to participate in a particular Flex-Algorithm and is advertising such participation, it is participating in that Flex-Algorithm. Paths for various data planes MAY be computed for a specific Flex-Algorithm. Each data plane uses its own specific forwarding over such Flex-Algorithm paths. To guarantee the presence of the data-plane-specific forwarding, associated with a particular Flex-Algorithm, a router MUST advertise its participation for a particular Flex-Algorithm for each data plane. Some data planes may share a common participation advertisement (e.g., SR-MPLS and SRv6). Advertisement of the participation for any particular Flex-Algorithm in any data plane is subject to the condition specified in .

Advertisement of Node Participation for Segment Routing , , and (IGP Segment Routing extensions) describe how the SR-Algorithm is used to compute the IGP best path. Routers advertise support for the SR-Algorithm as a node capability, as described in the above-mentioned IGP Segment Routing extensions. To advertise participation for a particular Flex-Algorithm for Segment Routing, including both SR-MPLS and SRv6, the Flex-Algorithm value MUST be advertised in the SR-Algorithm TLV (OSPF) or sub-TLV (IS-IS). Segment Routing Flex-Algorithm participation advertisement is topology independent. When a router advertises participation in an SR-Algorithm, the participation applies to all topologies in which the advertising node participates.

Advertisement of Node Participation for Other Data Planes This section describes considerations related to how other data planes can advertise their participation in a specific Flex-Algorithm. Data-plane-specific Flex-Algorithm participation advertisements MAY be topology specific or MAY be topology independent, depending on the data plane itself. Data-plane-specific advertisement for Flex-Algorithm participation MUST be defined for each data plane and is outside the scope of this document.

Advertisement of Link Attributes for Flex-Algorithm Various link attributes may be used during the Flex-Algorithm path calculation. For example, include or exclude rules based on link affinities can be part of the Flex-Algorithm Definition, as defined in Sections and . Application-specific link attributes, as specified in or , that are to be used during Flex-Algorithm calculation MUST use the Application-Specific Link Attribute (ASLA) advertisements defined in or unless, in the case of IS-IS, the L-flag is set in the ASLA advertisement. When the L-flag is set, then legacy advertisements MUST be used, subject to the procedures and constraints defined in and . The mandatory use of ASLA advertisements applies to link attributes specifically mentioned in this document (Min Unidirectional Link Delay, TE Default Metric, Administrative Group, Extended Administrative Group, and Shared Risk Link Group) and any other link attributes that may be used in support of Flex-Algorithm in the future. A new Application Identifier Bit is defined to indicate that the ASLA advertisement is associated with the Flex-Algorithm application. This bit is set in the Standard Application Bit Mask (SABM) defined in or :

Bit 3:

Flexible Algorithm (X-bit)

ASLA Admin Group Advertisements to be used by the Flexible Algorithm application MAY use either the Administrative Group or Extended Administrative Group encodings. A receiver supporting this specification MUST accept both ASLA Administrative Group and Extended Administrative Group TLVs, as defined in or . In the case of IS-IS, if the L-flag is set in the ASLA advertisement, as defined in , then the receiver MUST be able to accept both the Administrative Group TLV, as defined in , and the Extended Administrative Group TLV, as defined in .

Calculation of Flexible Algorithm Paths A router MUST be configured to participate in a given Flex-Algorithm K and MUST select the FAD based on the rules defined in before it can compute any path for that Flex-Algorithm. No specific two-way connectivity check is performed during the Flex-Algorithm path computation. The result of the existing Flex-Algorithm-agnostic, two-way connectivity check is used during the Flex-Algorithm path computation. As described in , participation for any particular Flex-Algorithm MUST be advertised on a per data plane basis. Calculation of the paths for any particular Flex-Algorithm is data plane specific. Multiple data planes MAY use the same Flex-Algorithm value at the same time and, as such, share the FAD for it. Traffic for each data plane will be forwarded based on the data-plane-specific forwarding entries. The Flex-Algorithm Definition is data plane independent and is used by all Flex-Algorithm data planes. The way various data planes handle nodes that do not participate in Flexible Algorithm is data plane specific. If the data plane only wants to consider participating nodes during the Flex-Algorithm calculation, then when computing paths for a given Flex-Algorithm, all nodes that do not advertise participation for that Flex-Algorithm in their data-plane-specific advertisements MUST be pruned from the topology. Segment Routing, including both SR-MPLS and SRv6, are data planes that MUST use such pruning when computing Flex-Algorithm paths. When computing the path for a given Flex-Algorithm, the metric-type that is part of the Flex-Algorithm Definition () MUST be used. When computing the path for a given Flex-Algorithm, the calculation-type that is part of the Flex-Algorithm Definition () MUST be used. Various links that include or exclude rules can be part of the Flex-Algorithm Definition. To refer to a particular bit within an Admin Group or Extended Admin Group, we use the term "color". Rules, in the order as specified below, MUST be used to prune links from the topology during the Flex-Algorithm computation. For all links in the topology:

1. Check if any exclude Administrative Group rule is part of the Flex-Algorithm Definition. If such exclude rule exists, check if any color that is part of the exclude rule is also set on the link. If such a color is set, the link MUST be pruned from the computation.
2. Check if any exclude SRLG rule is part of the Flex-Algorithm Definition. If such exclude rule exists, check if the link is part of any SRLG that is also part of the SRLG exclude rule. If the link is part of such SRLG, the link MUST be pruned from the computation.
3. Check if any include-any Administrative Group rule is part of the Flex-Algorithm Definition. If such include-any rule exists, check if any color that is part of the include-any rule is also set on the link. If no such color is set, the link MUST be pruned from the computation.
4. Check if any include-all Administrative Group rule is part of the Flex-Algorithm Definition. If such include-all rule exists, check if all colors that are part of the include-all rule are also set on the link. If all such colors are not set on the link, the link MUST be pruned from the computation.
5. If the Flex-Algorithm Definition uses something other than the IGP metric (), and such metric is not advertised for the particular link in a topology for which the computation is done, such link MUST be pruned from the computation. A metric of value 0 MUST NOT be assumed in such a case.

Multi-area and Multi-domain Considerations Any IGP Shortest Path Tree calculation is limited to a single area. This applies to Flex-Algorithm calculations as well. Given that the computing router does not have visibility of the topology of the next areas or domain, the Flex-Algorithm-specific path to an inter-area or inter-domain prefix will be computed for the local area only. The egress L1/L2 router (ABR in OSPF), or ASBR for an inter-domain case, will be selected based on the best path for the given Flex-Algorithm in the local area, and such egress ABR or ASBR router will be responsible to compute the best Flex-Algorithm-specific path over the next area or domain. This may produce an end-to-end path, which is suboptimal based on Flex-Algorithm constraints. In cases where the ABR or ASBR has no reachability to a prefix for a given Flex-Algorithm in the next area or domain, the traffic could be dropped by the ABR/ASBR. To allow the optimal end-to-end path for an inter-area or inter-domain prefix for any Flex-Algorithm to be computed, the FAPM has been defined in Sections and . For external route calculation for prefixes originated by ASBRs in remote areas in OSPF, the FAAM has been defined in for the ABR to indicate its ASBR reachability along with the metric for the specific Flex-Algorithm. If the FAD selected based on the rules defined in includes the M-flag, an ABR or an ASBR MUST include the FAPM (see Sections and ) when advertising the prefix that is reachable in a given Flex-Algorithm between areas or domains. Such metric will be equal to the metric to reach the prefix for that Flex-Algorithm in its source area or domain. This is similar in nature to how the metric is set when prefixes are advertised between areas or domains for the default algorithm. When a prefix is unreachable in its source area or domain in a specific Flex-Algorithm, then an ABR or ASBR MUST NOT include the FAPM for that Flex-Algorithm when advertising the prefix between areas or domains. If the FAD selected based on the rules defined in includes the M-flag, the FAPM MUST be used during the calculation of prefix reachability for the inter-area and external prefixes. If the FAPM for the Flex-Algorithm is not advertised with the inter-area or external prefix reachability advertisement, the prefix MUST be considered as unreachable for that Flex-Algorithm. Similarly, in the case of OSPF, for ASBRs in remote areas, if the FAAM is not advertised by the local ABR(s), the ASBR MUST be considered as unreachable for that Flex-Algorithm, and the external prefix advertisements from such an ASBR are not considered for that Flex-Algorithm. The Flex-Algorithm prefix metrics and the OSPF Flex-Algorithm ASBR metrics MUST NOT be used during the Flex-Algorithm computation unless the FAD selected based on the rules defined in includes the M-flag, as described in Sections or . In the case of OSPF, when calculating external routes in a Flex-Algorithm, if the winning FAD includes the M-flag, and the advertising ASBR is in a remote area, the metric will be the sum of the following:

• the FAPM for that Flex-Algorithm advertised with the external route by the ASBR
• the metric to reach the ASBR for that Flex-Algorithm from the local ABR, i.e., the FAAM for that Flex-Algorithm advertised by the ABR in the local area for that ASBR
• the Flex-Algorithm-specific metric to reach the local ABR

This is similar in nature to how the metric is calculated for routes learned from remote ASBRs in the default algorithm using the OSPFv2 Type 4 ASBR summary-LSA and the OSPFv3 Inter-Area-Router-LSA. If the FAD selected based on the rules defined in does not include the M-flag, then the IGP metrics associated with the prefix reachability advertisements used by the base IS-IS and OSPF protocol MUST be used for the Flex-Algorithm route computation. Similarly, in the case of external route calculations in OSPF, the ASBR reachability is determined based on the base OSPFv2 Type 4 summary-LSA and the OSFPv3 Inter-Area-Router-LSA. It is NOT RECOMMENDED to use the Flex-Algorithm for inter-area or inter-domain prefix reachability without the M-flag set. The reason is that, without the explicit Flex-Algorithm prefix metric advertisement (and the Flex-Algorithm ASBR metric advertisement in the case of OSPF external route calculation), it is not possible to conclude whether the ABR or ASBR has reachability to the inter-area or inter-domain prefix for a given Flex-Algorithm in the next area or domain. Sending the Flex-Algorithm traffic for such a prefix towards the ABR or ASBR may result in traffic looping or persistent traffic drop. During the route computation, it is possible for the Flex-Algorithm-specific metric to exceed the maximum value that can be stored in an unsigned 32-bit variable. In such scenarios, the value MUST be considered to be of value 0xFFFFFFFF during the computation and advertised as such. The FAPM MUST NOT be advertised with IS-IS L1 or L2 intra-area, OSPFv2 intra-area, or OSPFv3 intra-area routes. If the FAPM is advertised for these route-types, it MUST be ignored during the prefix reachability calculation. The M-flag in the FAD is not applicable to prefixes advertised as SRv6 locators. The IS-IS SRv6 Locator TLV includes the Algorithm and Metric fields. When the SRv6 Locator is advertised between areas or domains, the Metric field in the Locator TLV of IS-IS MUST be used irrespective of the M-flag in the FAD advertisement. OSPF external and NSSA external prefix advertisements MAY include a non-zero forwarding address in the prefix advertisements in the base protocol. In such a scenario, the Flex-Algorithm-specific reachability of the external prefix is determined by Flex-Algorithm-specific reachability of the forwarding address. In OSPF, the procedures for translation of NSSA external prefix advertisements into external prefix advertisements performed by an NSSA ABR remain unchanged for Flex-Algorithm. An NSSA translator MUST include the OSPF FAPM sub-TLVs for all Flex-Algorithms that are in the original NSSA external prefix advertisement from the NSSA ASBR in the translated external prefix advertisement generated by it, regardless of its participation in those Flex-Algorithms or its having reachability to the NSSA ASBR in those Flex-Algorithms. An area could become partitioned from the perspective of the Flex-Algorithm due to the constraints and/or metric being used for it while maintaining the continuity in the base algorithm. When that happens, some destinations inside that area could become unreachable in that Flex-Algorithm. These destinations will not be able to use an inter-area path. This is the consequence of the fact that the inter-area prefix reachability advertisement would not be available for these intra-area destinations within the area. It is RECOMMENDED to minimize the risk of such partitioning by providing enough redundancy inside the area for each Flex-Algorithm being used.

Flex-Algorithm and Forwarding Plane This section describes how Flex-Algorithm paths are used in forwarding.

Segment Routing MPLS Forwarding for Flex-Algorithm This section describes how Flex-Algorithm paths are used with SR MPLS forwarding. Prefix-SID advertisements include an SR-Algorithm value and, as such, are associated with the specified SR-Algorithm. Prefix-SIDs are also associated with a specific topology that is inherited from the associated prefix reachability advertisement. When the algorithm value advertised is a Flex-Algorithm value, the Prefix-SID is associated with paths calculated using that Flex-Algorithm in the associated topology. A Flex-Algorithm path MUST be installed in the MPLS forwarding plane using the MPLS label that corresponds to the Prefix-SID that was advertised for that Flex-algorithm. If the Prefix-SID for a given Flex-Algorithm is not known, the Flex-Algorithm-specific path cannot be installed in the MPLS forwarding plane. Traffic that is supposed to be routed via Flex-Algorithm-specific paths MUST be dropped when there are no such paths available. Loop Free Alternate (LFA) paths ( or its variants) for a given Flex-Algorithm MUST be computed using the same constraints as the calculation of the primary paths for that Flex-Algorithm. LFA paths MUST only use Prefix-SIDs advertised specifically for the given algorithm. LFA paths MUST NOT use an Adjacency SID that belongs to a link that has been pruned from the Flex-Algorithm computation. If LFA protection is being used to protect a given Flex-Algorithm path, all routers in the area participating in the given Flex-Algorithm SHOULD advertise at least one Flex-Algorithm-specific Node-SID. These Node-SIDs are used to steer traffic over the LFA-computed backup path.

SRv6 Forwarding for Flex-Algorithm This section describes how Flex-Algorithm paths are used with SRv6 forwarding. In SRv6, a node is provisioned with a (topology, algorithm) specific locator for each of the topology/algorithm pairs supported by that node. Each locator is an aggregate prefix for all SIDs provisioned on that node that have the matching topology/algorithm. The SRv6 locator advertisement in IS-IS includes the Multi-Topology Identifier (MTID) value that associates the locator with a specific topology. SRv6 locator advertisements also include an algorithm value that explicitly associates the locator with a specific algorithm. When the algorithm value advertised with a locator represents a Flex-Algorithm, the paths to the locator prefix MUST be calculated using the specified Flex-Algorithm in the associated topology. Forwarding entries for the locator prefixes advertised in IS-IS MUST be installed in the forwarding plane of the receiving SRv6-capable routers when the associated topology/algorithm is participating in them. Forwarding entries for locators associated with Flex-Algorithms in which the node is not participating MUST NOT be installed in the forwarding plane. When the locator is associated with a Flex-Algorithm, LFA paths to the locator prefix MUST be calculated using such Flex-Algorithm in the associated topology to guarantee that they follow the same constraints as the calculation of the primary paths. LFA paths MUST only use SRv6 SIDs advertised specifically for the given Flex-Algorithm. If LFA protection is being used to protect locators associated with a given Flex-Algorithm, all routers in the area participating in the given Flex-Algorithm SHOULD advertise at least one Flex-Algorithm-specific locator and END SID per node and one END.X SID for every link that has not been pruned from such Flex-Algorithm computation. These locators and SIDs are used to steer traffic over the LFA-computed backup path.

Other Data Planes' Forwarding for Flex-Algorithm Any data plane that wants to use Flex-Algorithm-specific forwarding needs to install some form of Flex-Algorithm-specific forwarding entries. Data-plane-specific forwarding for Flex-Algorithms MUST be defined for each data plane and is outside the scope of this document.

Operational Considerations

Inter-area Considerations The scope of the Flex-Algorithm computation and the scope of the FAD is an area. In IS-IS, the Router Capability TLV in which the FAD sub-TLV is advertised MUST have the S bit clear, which prevents it from being flooded outside the level in which it was originated. Even though in OSPF the FAD sub-TLV can be flooded in an RI LSA that has an AS flooding scope, the FAD selection is performed for each individual area in which it is being used. There is no requirement for the FAD for a particular Flex-Algorithm to be identical in all areas in the network. For example, traffic for the same Flex-Algorithm may be optimized for minimal delay (e.g., using delay metric) in one area or level while being optimized for available bandwidth (e.g., using IGP metric) in another area or level. As described in , IS-IS allows the regeneration of the winning FAD from level 2, without any modification to it, into a level 1 area. This allows the operator to configure the FAD in one or multiple routers in level 2, without the need to repeat the same task in each level 1 area, if the intent is to have the same FAD for the particular Flex-Algorithm across all levels. This can similarly be achieved in OSPF by using the AS flooding scope of the RI LSA in which the FAD sub-TLV for the particular Flex-Algorithm is advertised. Regeneration of the FAD from a level 1 area to the level 2 area is not supported in IS-IS, so if the intent is to regenerate the FAD between IS-IS levels, the FAD MUST be defined on a router(s) that is in level 2. In OSPF, the FAD definition can be done in any area and propagated to all routers in the OSPF routing domain by using the AS flooding scope of the RI LSA.

Usage of the SRLG Exclude Rule with Flex-Algorithm There are two different ways in which SRLG information can be used with Flex-Algorithms:

• In a context of a single Flex-Algorithm, it can be used for computation of backup paths, as described in . This usage does not require association of any specific SRLG constraint with the given Flex-Algorithm Definition.
• In the context of multiple Flex-Algorithms, it can be used for creating disjoint sets of paths by pruning the links belonging to a specific SRLG from the topology on which a specific Flex-Algorithm computes its paths. This usage:
  • facilitates the usage of already deployed SRLG configurations for the setup of disjoint paths between two or more Flex-Algorithms and
  • requires explicit association of a given Flex-Algorithm with a specific set of SRLG constraints, as defined in Sections and .

The two usages mentioned above are orthogonal.

Max-Metric Consideration Both IS-IS and OSPF have a mechanism to set the IGP metric on a link to a value that would make the link either unreachable or serve as the link of last resort. Similar functionality would be needed for the Min Unidirectional Link Delay and TE metric, as these can be used to compute Flex-Algorithm paths. The link can be made unreachable for all Flex-Algorithms that use the Min Unidirectional Link Delay as a metric, as described in , by removing the Flex-Algorithm ASLA Min Unidirectional Link Delay advertisement for the link. The link can be made the link of last resort by setting the delay value in the Flex-Algorithm ASLA delay advertisement for the link to the value of 16,777,215 (2²⁴ - 1). The link can be made unreachable for all Flex-Algorithms that use the TE metric, as described in , by removing the Flex-Algorithm ASLA TE metric advertisement for the link. The link can be made the link of last resort by setting the TE metric value in the Flex-Algorithm ASLA delay advertisement for the link to the value of (2²⁴ - 1) in IS-IS and (2³² - 1) in OSPF.

Flexible Algorithm Definition and Changes When configuring a node to participate in a specific Flex-Algorithm, the components of the FAD (calculation-type, metric-type, and constraints) should be considered carefully. The configuration of participation in a particular Flex-Algorithm doesn't guarantee that the node will actively participate in it, because it may not support the calculation-type, the metric-type, or some constraint advertised by the winning FAD (see ). Changes in the FAD configuration should also be considered in light of the capabilities of the participating routers in the scope of the FAD advertisement. As notes, a change in the Flex-Algorithm Definition may require network-wide Shortest Path First (SPF) recomputation and network reconvergence. This potential for disruption should be taken into consideration when planning and making changes to the FAD.

Number of Flex-Algorithms The maximum number of Flex-Algorithms is determined by the algorithm range 128-255, as specified in . Although possible, it is not expected that all of them will be used simultaneously. Typically, only a limited subset of Flex-Algorithms is expected to be deployed in the network.

Backward Compatibility This extension brings no new backward-compatibility issues. IS-IS, OSPFv2, and OSPFv3 all have well-defined handling of unrecognized TLVs and sub-TLVs that allows the introduction of new extensions, similar to those defined here, without introducing any interoperability issues.

Security Considerations This document adds two new ways to disrupt IGP networks:

• An attacker can hijack a particular Flex-Algorithm by advertising a FAD with a priority of 255 (or any priority higher than that of the legitimate nodes).
• An attacker could make it look like a router supports a particular Flex-Algorithm when it actually doesn't, or vice versa.

Both of these attacks can be addressed by the existing security extensions, as described in and for IS-IS, in and for OSPFv2, and in and for OSPFv3. If the node that is authenticated is taken over by an attacker, such rogue node can advertise the FAD for any Flex-Algorithm. Doing so may result in traffic for such Flex-Algorithm to be misrouted, or not delivered at all, for example, by using an unsupported metric-type, calculation-type, or constraint. Such attack is not preventable through authentication, and it is not different from advertising any other incorrect information through IS-IS or OSPF.

IANA Considerations

IGP IANA Considerations

IGP Algorithm Types Registry This document makes the following registration in the "IGP Algorithm Types" registry: IGP Algorithm Types Registry

Value	Description	Reference
128-255	Flexible Algorithms	RFC 9350,

IGP Metric-Type Registry IANA has created the "IGP Metric-Type" registry within the "Interior Gateway Protocol (IGP) Parameters" registry group. The registration policy is "Standards Action" . Values are assigned from the range 0-255 and have been registered as follows. IGP Metric-Type Registry

Type	Description	Reference
0	IGP Metric	RFC 9350,
1	Min Unidirectional Link Delay as defined in and	RFC 9350,
2	Traffic Engineering Default Metric as defined in and Traffic Engineering Metric as defined in	RFC 9350,

IGP Flexible Algorithm Definition Flags Registry IANA has created the "IGP Flexible Algorithm Definition Flags" registry within the "Interior Gateway Protocol (IGP) Parameters" registry group. The registration policy is "Standards Action". New registrations should be assigned in ascending bit order (see ); the following single bit has been assigned as follows. IGP Flexible Algorithm Definition Flags Registry

Bit	Name	Reference
0	Prefix Metric Flag (M-flag)	RFC 9350, Sections and

IS-IS IANA Considerations

IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV Registry This document makes the following registration in the "IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV" registry. IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV Registry

Value	Description	Reference
26	Flexible Algorithm Definition (FAD)	RFC 9350,

IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability Registry This document makes the following registration in the "IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability" registry. IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability Registry

Type	Description	27	135	235	236	237	Reference
6	Flexible Algorithm Prefix Metric (FAPM)	n	y	y	y	y	RFC 9350,

IS-IS Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV Registry IANA has created the "IS-IS Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV" registry within the "IS-IS TLV Codepoints" registry group. The registration procedure is "Expert Review" (note that the "IS-IS TLV Codepoints" registry group includes Expert Review guidance that applies to all registries thereunder). The sub-sub-TLVs defined in this document have been assigned as follows. IS-IS Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV Registry

Type	Description	Reference
0	Reserved	RFC 9350
1	Flexible Algorithm Exclude Admin Group	RFC 9350,
2	Flexible Algorithm Include-Any Admin Group	RFC 9350,
3	Flexible Algorithm Include-All Admin Group	RFC 9350,
4	Flexible Algorithm Definition Flags	RFC 9350,
5	Flexible Algorithm Exclude SRLG	RFC 9350,
6-255	Unassigned

OSPF IANA Considerations

OSPF Router Information (RI) TLVs Registry This document makes the following registration in the "OSPF Router Information (RI) TLVs" registry. OSPF Router Information (RI) TLVs Registry

Value	Description	Reference
16	Flexible Algorithm Definition (FAD) TLV	RFC 9350,

OSPFv2 Extended Prefix TLV Sub-TLVs Registry This document makes the following registration in the "OSPFv2 Extended Prefix TLV Sub-TLVs" registry. OSPFv2 Extended Prefix TLV Sub-TLVs Registry

Value	Description	Reference
3	Flexible Algorithm Prefix Metric (FAPM)	RFC 9350,

OSPFv3 Extended-LSA Sub-TLVs Registry This document makes the following registrations in the "OSPFv3 Extended-LSA Sub-TLVs" registry. OSPFv3 Extended-LSA Sub-TLVs Registry

Value	Description	Reference
26	Flexible Algorithm Prefix Metric (FAPM)	RFC 9350,
33	OSPF Flexible Algorithm ASBR Metric	RFC 9350,

OSPF Flex-Algorithm Prefix Metric Bits Registry IANA has created the "OSPF Flex-Algorithm Prefix Metric Bits" registry under the "Open Shortest Path First (OSPF) Parameters" registry. The registration procedure is "IETF Review". Bits 1-7 are unassigned, and the initial value has been assigned as follows. OSPF Flex-Algorithm Prefix Metric Bits Registry

Bit Number	Description	Reference
0	E bit - External Type	RFC 9350,

Opaque Link-State Advertisements (LSA) Option Types Registry This document makes the following registration in the "Opaque Link-State Advertisements (LSA) Option Types" registry within the "Open Shortest Path First (OSPF) Opaque Link-State Advertisements (LSA) Option Types" registry group. Opaque Link-State Advertisements (LSA) Option Types Registry

Value	Opaque Type	Reference
11	OSPFv2 Extended Inter-Area ASBR (EIA-ASBR) LSA	RFC 9350,

OSPFv2 Extended Inter-Area ASBR TLVs Registry IANA has created the "OSPFv2 Extended Inter-Area ASBR TLVs" registry within the "Open Shortest Path First v2 (OSPFv2) Parameters" registry group. The registration procedure is "IETF Review" or "IESG Approval". The initial value has been assigned as follows. OSPFv2 Extended Inter-Area ASBR TLVs Registry

Value	Description	Reference
1	Extended Inter-Area ASBR	RFC 9350

The values 2-32767 are unassigned, the values 32768-33023 are reserved for Experimental Use, and the values 0 and 33024-65535 are reserved.

OSPFv2 Extended Inter-Area ASBR Sub-TLVs Registry IANA has created the "OSPFv2 Extended Inter-Area ASBR Sub-TLVs" registry under the "Open Shortest Path First v2 (OSPFv2) Parameters" registry. The registration procedure is "IETF Review" or "IESG Approval". The initial value has been assigned as follows. OSPFv2 Extended Inter-Area ASBR Sub-TLVs Registry

Value	Description	Reference
1	OSPF Flexible Algorithm ASBR Metric	RFC 9350

The values 2-32767 are unassigned, the values 32768-33023 are reserved for Experimental Use, and the values 0 and 33024-65535 are reserved.

OSPF Flexible Algorithm Definition TLV Sub-TLVs Registry IANA has created the "OSPF Flexible Algorithm Definition TLV Sub-TLVs" registry within the "Open Shortest Path First (OSPF) Parameters" registry group. The registration procedure is "IETF Review" or "IESG Approval". The "OSPF Flexible Algorithm Definition TLV Sub-TLVs" registry will define sub-TLVs at any level of nesting for the Flexible Algorithm TLV, and new values can be allocated via the registration procedure. This document registers the following sub-TLVs. OSPF Flexible Algorithm Definition TLV Sub-TLVs Registry

Bit Number	Description	Reference
0	Reserved	RFC 9350
1	Flexible Algorithm Exclude Admin Group	RFC 9350,
2	Flexible Algorithm Include-Any Admin Group	RFC 9350,
3	Flexible Algorithm Include-All Admin Group	RFC 9350,
4	Flexible Algorithm Definition Flags	RFC 9350,
5	Flexible Algorithm Exclude SRLG	RFC 9350,

The values 6-32767 are unassigned, and values 32768-33023 are for Experimental Use; these will not be registered with IANA. Types in the range 33024-65535 are not to be assigned at this time. Before any assignments can be made in the 33024-65535 range, there MUST be an IETF specification that specifies IANA considerations that cover the range being assigned.

Link Attribute Application Identifiers Registry This document registers the following bit in the "Link Attribute Application Identifiers" registry. Link Attribute Application Identifiers Registry

Bit	Description	Reference
3	Flexible Algorithm (X-bit)	RFC 9350,

References Normative References International Organization for Standardization Second Edition In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. This document specifies encoding of extensions to the OSPF routing protocol in support of Generalized Multi-Protocol Label Switching (GMPLS). [STANDARDS-TRACK] This document defines enhancements to the OSPF protocol to support a new class of link state advertisements (LSAs) called Opaque LSAs. Opaque LSAs provide a generalized mechanism to allow for the future extensibility of OSPF. Opaque LSAs consist of a standard LSA header followed by application-specific information. The information field may be used directly by OSPF or by other applications. Standard OSPF link-state database flooding mechanisms are used to distribute Opaque LSAs to all or some limited portion of the OSPF topology. This document replaces RFC 2370 and adds to it a mechanism to enable an OSPF router to validate Autonomous System (AS)-scope Opaque LSAs originated outside of the router's OSPF area. [STANDARDS-TRACK] This document specifies encoding of extensions to the IS-IS routing protocol in support of Generalized Multi-Protocol Label Switching (GMPLS). [STANDARDS-TRACK] MPLS Traffic Engineering (MPLS-TE) advertises 32 administrative groups (commonly referred to as "colors" or "link colors") using the Administrative Group sub-TLV. This is defined for OSPFv2 (RFC 3630), OSPFv3 (RFC 5329) and IS-IS (RFC 5305). This document adds a sub-TLV to the IGP TE extensions, "Extended Administrative Group". This sub-TLV provides for additional administrative groups (link colors) beyond the current limit of 32. OSPFv2 requires functional extension beyond what can readily be done with the fixed-format Link State Advertisements (LSAs) as described in RFC 2328. This document defines OSPFv2 Opaque LSAs based on Type-Length-Value (TLV) tuples that can be used to associate additional attributes with prefixes or links. Depending on the application, these prefixes and links may or may not be advertised in the fixed-format LSAs. The OSPFv2 Opaque LSAs are optional and fully backward compatible. It is useful for routers in an OSPFv2 or OSPFv3 routing domain to know the capabilities of their neighbors and other routers in the routing domain. This document proposes extensions to OSPFv2 and OSPFv3 for advertising optional router capabilities. The Router Information (RI) Link State Advertisement (LSA) is defined for this purpose. In OSPFv2, the RI LSA will be implemented with an Opaque LSA type ID. In OSPFv3, the RI LSA will be implemented with a unique LSA type function code. In both protocols, the RI LSA can be advertised at any of the defined flooding scopes (link, area, or autonomous system (AS)). This document obsoletes RFC 4970 by providing a revised specification that includes support for advertisement of multiple instances of the RI LSA and a TLV for functional capabilities. This document defines a new optional Intermediate System to Intermediate System (IS-IS) TLV named CAPABILITY, formed of multiple sub-TLVs, which allows a router to announce its capabilities within an IS-IS level or the entire routing domain. This document obsoletes RFC 4971. RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. OSPFv3 requires functional extension beyond what can readily be done with the fixed-format Link State Advertisement (LSA) as described in RFC 5340. Without LSA extension, attributes associated with OSPFv3 links and advertised IPv6 prefixes must be advertised in separate LSAs and correlated to the fixed-format LSAs. This document extends the LSA format by encoding the existing OSPFv3 LSA information in Type-Length-Value (TLV) tuples and allowing advertisement of additional information with additional TLVs. Backward-compatibility mechanisms are also described. This document updates RFC 5340, "OSPF for IPv6", and RFC 5838, "Support of Address Families in OSPFv3", by providing TLV-based encodings for the base OSPFv3 unicast support and OSPFv3 address family support. Segment Routing (SR) leverages the source-routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS data plane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS data plane (SR-MPLS). Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological subpaths called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This document describes the OSPFv2 extensions required for Segment Routing. Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological subpaths called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This document describes the OSPFv3 extensions required for Segment Routing with the MPLS data plane. Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This document describes the IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data plane. Existing traffic-engineering-related link attribute advertisements have been defined and are used in RSVP-TE deployments. Since the original RSVP-TE use case was defined, additional applications (e.g., Segment Routing Policy and Loop-Free Alternates) that also make use of the link attribute advertisements have been defined. In cases where multiple applications wish to make use of these link attributes, the current advertisements do not support application-specific values for a given attribute, nor do they support indication of which applications are using the advertised value for a given link. This document introduces new link attribute advertisements that address both of these shortcomings. Existing traffic-engineering-related link attribute advertisements have been defined and are used in RSVP-TE deployments. Since the original RSVP-TE use case was defined, additional applications (e.g., Segment Routing Policy and Loop-Free Alternates) that also make use of the link attribute advertisements have been defined. In cases where multiple applications wish to make use of these link attributes, the current advertisements do not support application-specific values for a given attribute, nor do they support indication of which applications are using the advertised value for a given link. This document introduces new link attribute advertisements in OSPFv2 and OSPFv3 that address both of these shortcomings. Informative References This memo documents version 2 of the OSPF protocol. OSPF is a link- state routing protocol. [STANDARDS-TRACK] This memo documents an optional type of Open Shortest Path First (OSPF) area that is somewhat humorously referred to as a "not-so-stubby" area (or NSSA). NSSAs are similar to the existing OSPF stub area configuration option but have the additional capability of importing AS external routes in a limited fashion. The OSPF NSSA Option was originally defined in RFC 1587. The functional differences between this memo and RFC 1587 are explained in Appendix F. All differences, while expanding capability, are backward-compatible in nature. Implementations of this memo and of RFC 1587 will interoperate. [STANDARDS-TRACK] This document describes extensions to the OSPF protocol version 2 to support intra-area Traffic Engineering (TE), using Opaque Link State Advertisements. This document describes how conventional hop-by-hop link-state routing protocols interact with new Traffic Engineering capabilities to create Interior Gateway Protocol (IGP) shortcuts. In particular, this document describes how Dijkstra's Shortest Path First (SPF) algorithm can be adapted so that link-state IGPs will calculate IP routes to forward traffic over tunnels that are set up by Traffic Engineering. This memo provides information for the Internet community. This document describes means and mechanisms to provide authentication/confidentiality to OSPFv3 using an IPv6 Authentication Header/Encapsulating Security Payload (AH/ESP) extension header. [STANDARDS-TRACK] This document describes the authentication of Intermediate System to Intermediate System (IS-IS) Protocol Data Units (PDUs) using the Hashed Message Authentication Codes - Message Digest 5 (HMAC-MD5) algorithm as found in RFC 2104. IS-IS is specified in International Standards Organization (ISO) 10589, with extensions to support Internet Protocol version 4 (IPv4) described in RFC 1195. The base specification includes an authentication mechanism that allows for multiple authentication algorithms. The base specification only specifies the algorithm for cleartext passwords. This document replaces RFC 3567. This document proposes an extension to that specification that allows the use of the HMAC-MD5 authentication algorithm to be used in conjunction with the existing authentication mechanisms. [STANDARDS-TRACK] This document describes extensions to the Intermediate System to Intermediate System (IS-IS) protocol to support Traffic Engineering (TE). This document extends the IS-IS protocol by specifying new information that an Intermediate System (router) can place in Link State Protocol Data Units (LSP). This information describes additional details regarding the state of the network that are useful for traffic engineering computations. [STANDARDS-TRACK] This document proposes an extension to Intermediate System to Intermediate System (IS-IS) to allow the use of any cryptographic authentication algorithm in addition to the already-documented authentication schemes, described in the base specification and RFC 5304. IS-IS is specified in International Standards Organization (ISO) 10589, with extensions to support Internet Protocol version 4 (IPv4) described in RFC 1195. Although this document has been written specifically for using the Hashed Message Authentication Code (HMAC) construct along with the Secure Hash Algorithm (SHA) family of cryptographic hash functions, the method described in this document is generic and can be used to extend IS-IS to support any cryptographic hash function in the future. [STANDARDS-TRACK] This document describes the modifications to OSPF to support version 6 of the Internet Protocol (IPv6). The fundamental mechanisms of OSPF (flooding, Designated Router (DR) election, area support, Short Path First (SPF) calculations, etc.) remain unchanged. However, some changes have been necessary, either due to changes in protocol semantics between IPv4 and IPv6, or simply to handle the increased address size of IPv6. These modifications will necessitate incrementing the protocol version from version 2 to version 3. OSPF for IPv6 is also referred to as OSPF version 3 (OSPFv3). Changes between OSPF for IPv4, OSPF Version 2, and OSPF for IPv6 as described herein include the following. Addressing semantics have been removed from OSPF packets and the basic Link State Advertisements (LSAs). New LSAs have been created to carry IPv6 addresses and prefixes. OSPF now runs on a per-link basis rather than on a per-IP-subnet basis. Flooding scope for LSAs has been generalized. Authentication has been removed from the OSPF protocol and instead relies on IPv6's Authentication Header and Encapsulating Security Payload (ESP). Even with larger IPv6 addresses, most packets in OSPF for IPv6 are almost as compact as those in OSPF for IPv4. Most fields and packet- size limitations present in OSPF for IPv4 have been relaxed. In addition, option handling has been made more flexible. All of OSPF for IPv4's optional capabilities, including demand circuit support and Not-So-Stubby Areas (NSSAs), are also supported in OSPF for IPv6. [STANDARDS-TRACK] In this document, we analyze the applicability of the Loop-Free Alternate (LFA) method of providing IP fast reroute in both the core and access parts of Service Provider networks. We consider both the link and node failure cases, and provide guidance on the applicability of LFAs to different network topologies, with special emphasis on the access parts of the network. This document is not an Internet Standards Track specification; it is published for informational purposes. This memo describes the process for early allocation of code points by IANA from registries for which "Specification Required", "RFC Required", "IETF Review", or "Standards Action" policies apply. This process can be used to alleviate the problem where code point allocation is needed to facilitate desired or required implementation and deployment experience prior to publication of an RFC, which would normally trigger code point allocation. The procedures in this document are intended to apply only to IETF Stream documents. In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network performance information (e.g., link propagation delay) is becoming critical to data path selection. This document describes common extensions to RFC 3630 "Traffic Engineering (TE) Extensions to OSPF Version 2" and RFC 5329 "Traffic Engineering Extensions to OSPF Version 3" to enable network performance information to be distributed in a scalable fashion. The information distributed using OSPF TE Metric Extensions can then be used to make path selection decisions based on network performance. Note that this document only covers the mechanisms by which network performance information is distributed. The mechanisms for measuring network performance information or using that information, once distributed, are outside the scope of this document. The current OSPFv2 cryptographic authentication mechanism as defined in RFCs 2328 and 5709 is vulnerable to both inter-session and intra- session replay attacks when using manual keying. Additionally, the existing cryptographic authentication mechanism does not cover the IP header. This omission can be exploited to carry out various types of attacks. This document defines changes to the authentication sequence number mechanism that will protect OSPFv2 from both inter-session and intra- session replay attacks when using manual keys for securing OSPFv2 protocol packets. Additionally, we also describe some changes in the cryptographic hash computation that will eliminate attacks resulting from OSPFv2 not protecting the IP header. Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA). To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry. This is the third edition of this document; it obsoletes RFC 5226. In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network-performance criteria (e.g., latency) are becoming as critical to data-path selection as other metrics. This document describes extensions to IS-IS Traffic Engineering Extensions (RFC 5305). These extensions provide a way to distribute and collect network-performance information in a scalable fashion. The information distributed using IS-IS TE Metric Extensions can then be used to make path-selection decisions based on network performance. Note that this document only covers the mechanisms with which network-performance information is distributed. The mechanisms for measuring network performance or acting on that information, once distributed, are outside the scope of this document. This document obsoletes RFC 7810. The Segment Routing over IPv6 (SRv6) Network Programming framework enables a network operator or an application to specify a packet processing program by encoding a sequence of instructions in the IPv6 packet header. Each instruction is implemented on one or several nodes in the network and identified by an SRv6 Segment Identifier in the packet. This document defines the SRv6 Network Programming concept and specifies the base set of SRv6 behaviors that enables the creation of interoperable overlays with underlay optimization. Juniper Networks Thomson Reuters Many network deployments arrange the network topologies in two or more planes. The traffic generally uses one of the planes and fails over to the other plane when there are link or node failure. Certain applications require the traffic to be strictly restricted to a particular plane and should not failover to the other plane. This document proposes a solution for the strict planar routing using Segment Routing. Work in Progress Cisco Systems Individual Cisco Systems INSA Lyon Orange Bell Canada This document presents Topology Independent Loop-free Alternate Fast Re-route (TI-LFA), aimed at providing protection of node and adjacency segments within the Segment Routing (SR) framework. This Fast Re-route (FRR) behavior builds on proven IP-FRR concepts being LFAs, remote LFAs (RLFA), and remote LFAs with directed forwarding (DLFA). It extends these concepts to provide guaranteed coverage in any two connected network using a link-state IGP. A key aspect of TI-LFA is the FRR path selection approach establishing protection over the expected post-convergence paths from the point of local repair, reducing the operational need to control the tie-breaks among various FRR options. Work in Progress

Acknowledgements This document, among other things, addresses the problem that was trying to solve. All authors of that document agreed to join this document. Thanks to , , , , , , and for their detailed review and excellent comments. Thanks to for his review and feedback during the initial phase of the solution definition. Thanks to for his comments. Thanks to for editorial comments.

Authors' Addresses Cisco Systems, Inc.

Apollo Business Center Mlynske nivy 43 Bratislava 82109 Slovakia ppsenak@cisco.com

Juniper Networks, Inc.

Embassy Business Park Bangalore KA 560093 India shraddha@juniper.net

Cisco Systems, Inc.

Brussels Belgium cfilsfil@cisco.com

Cisco Systems, Inc

India ketant.ietf@gmail.com

Edward Jones

arkadiy.gulko@edwardjones.com