<?xml version="1.0" encoding="US-ASCII"?>
<!DOCTYPE rfc SYSTEM "rfc2629.dtd">
<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<?rfc toc="yes" ?>
<?rfc symrefs="yes" ?>
<?rfc sortrefs="yes"?>
<?rfc iprnotified="no" ?>
<?rfc strict="yes" ?>
<?rfc compact='yes'?>
<?rfc subcompact='no'?>
<rfc category="std" docName="draft-ietf-lsr-flex-algo-21" ipr="trust200902">
  <front>
    <title abbrev="IGP Flexible Algorithm">IGP Flexible Algorithm</title>

    <author fullname="Peter Psenak" initials="P." role="editor"
            surname="Psenak">
      <organization>Cisco Systems</organization>

      <address>
        <postal>
          <street>Apollo Business Center</street>

          <street>Mlynske nivy 43</street>

          <city>Bratislava</city>

          <region>82109</region>

          <country>Slovakia</country>

          <code/>
        </postal>

        <email>ppsenak@cisco.com</email>
      </address>
    </author>

    <author fullname="Shraddha Hegde" initials="S" surname="Hegde">
      <organization>Juniper Networks, Inc.</organization>

      <address>
        <postal>
          <street>Embassy Business Park</street>

          <street/>

          <city>Bangalore, KA</city>

          <region>560093</region>

          <country>India</country>

          <code/>
        </postal>

        <email>shraddha@juniper.net</email>
      </address>
    </author>

    <author fullname="Clarence Filsfils" initials="C." surname="Filsfils">
      <organization>Cisco Systems, Inc.</organization>

      <address>
        <postal>
          <street/>

          <city>Brussels</city>

          <region/>

          <code/>

          <country>Belgium</country>
        </postal>

        <email>cfilsfil@cisco.com</email>
      </address>
    </author>

    <author fullname="Ketan Talaulikar" initials="K." surname="Talaulikar">
      <organization>Arrcus, Inc</organization>

      <address>
        <postal>
          <street></street>

          <city></city>

          <code></code>

          <country>India</country>
        </postal>

        <email>ketant.ietf@gmail.com</email>
      </address>
    </author>

    <author fullname="Arkadiy Gulko" initials="A." surname="Gulko">
      <organization>Edward Jones</organization>

      <address>
        <postal>
          <street/>

          <city/>

          <region/>

          <code/>

          <country/>
        </postal>

        <email>arkadiy.gulko@edwardjones.com</email>
      </address>
    </author>

    <date/>

    <abstract>
      <t>IGP protocols traditionally compute best paths over the network based
      on the IGP metric assigned to the links. Many network deployments use
      RSVP-TE based or Segment Routing based Traffic Engineering 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.</t>
    </abstract>
  </front>

  <middle>
    <section title="Introduction">
      <t>An IGP-computed path based on the shortest IGP metric is often be
      replaced by a traffic-engineered path due to the traffic requirements
      which 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 is reflecting the
      bandwidth on the link and the user traffic is delay sensitive,
      the best IGP path may not reflect the best path from such a user's perspective.</t>

      <t>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 <xref target="RFC3906"/> are
      used to replace the native IGP paths with such tunnel paths.</t>

      <t>This document specifies a set of extensions to IS-IS, OSPFv2, and
      OSPFv3 that enable a router to advertise TLVs that (a) identify
      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.</t>

      <t>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 <xref target="RFC8660"/>, or Segment Routing over IPv6 (SRv6) 
      locators <xref target="RFC8986"/> 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.</t>
    </section>

    <section anchor="reqlang" title="Requirements Language">
      <t>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
      <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when,
      they appear in all capitals, as shown here.</t>
    </section>

    <section anchor="TERMINOLOGY" title="Terminology">
      <t>This section defines terms that are often used in this document.</t>

      <t>Flexible Algorithm Definition (FAD) - the set consisting of (a)
      calculation-type, (b) metric-type, and (c) a set of constraints.</t>

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

      <t>Local Flexible Algorithm Definition - Flexible Algorithm Definition
      defined locally on the node.</t>

      <t>Remote Flexible Algorithm Definition - Flexible Algorithm Definition
      received from other nodes via IGP flooding.</t>

      <t>Flexible Algorithm Participation - per 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) a given router 
  	  participates in is determined by configuration.</t>

      <t>IGP Algorithm - value from the the "IGP Algorithm Types" registry
      defined under "Interior Gateway Protocol (IGP) Parameters" IANA
      registry grouping. IGP Algorithms represents the triplet (Calculation Type,
      Metric, Constraints), where the second and third elements of the triple
      MAY be unspecified.</t>

      <t>ABR - Area Border Router. In IS-IS terminology it is also known as
      L1/L2 router.</t>

      <t>ASBR - Autonomous System Border Router.</t>
    </section>

    <section anchor="FLEXALG" title="Flexible Algorithm">
      <t>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 <xref
      target="RFC8570"/>. Constraints which restrict paths to links with
      specific affinities or avoid links with specific affinities are also
      possible. Combinations of these are also possible.</t>

      <t>To provide maximum flexibility, we want to provide a mechanism that
      allows a router to (a) identify a particular calculation-type and (b)
      metric-type, (c) describe a particular set of constraints, and (d)
      assign a numeric identifier, referred to as Flex-Algorithm, to the
      combination of that calculation-type, metric-type, and those
      constraints. We want the mapping between the Flex-Algorithm and its
      meaning to be 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.</t>

      <t>The set consisting of (a) calculation-type, (b) metric-type, and (c)
      a set of constraints is referred to as a Flexible-Algorithm
      Definition.</t>

      <t>Flexible-Algorithm is a numeric identifier in the range 128-255 that
      is associated via configuratin with the Flexible-Algorithm
      Definition.</t>

      <t>The IANA "IGP Algorithm Types" registry defines the set of values for IGP
      Algorithms. The following values area allocated from this registry for
      Flex-Algorithms: <list style="hanging">
          <t>128-255 - Flex-Algorithms</t>
        </list></t>
    </section>

    <section anchor="FLEXALGDEF"
             title="Flexible Algorithm Definition Advertisement">
      <t>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.</t>

      <section anchor="ISISFLEXALGTLV"
               title="IS-IS Flexible Algorithm Definition Sub-TLV">
        <t>The IS-IS Flexible Algorithm Definition Sub-TLV (FAD Sub-TLV) is
        used to advertise the definition of the Flex-Algorithm.</t>

        <t>The IS-IS FAD Sub-TLV is advertised as a Sub-TLV of the IS-IS Router
        Capability TLV-242 that is defined in <xref target="RFC7981"/>.</t>

        <t>IS-IS FAD Sub-TLV has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 26</t>

            <t>Length: variable, dependent on the included Sub-TLVs</t>

            <t>Flex-Algorithm: Single octet value between 128 and 255
            inclusive.</t>

            <t>Metric-Type: Type of metric to be used during the calculation.
            The following values are defined: <list style="hanging">
                <t>0: IGP Metric</t>

                <t>1: Min Unidirectional Link Delay as defined in <xref
                target="RFC8570"/>, section 4.2, encoded as application
                specific link attribute as specified in <xref
                target="RFC8919"/> and <xref target="FLEXALGLINKATTR"/> of
                this document.</t>

                <t>2: Traffic Engineering Default Metric as defined in <xref
                target="RFC5305"/>, section 3.7, encoded as application
                specific link attribute as specified in <xref
                target="RFC8919"/> and <xref target="FLEXALGLINKATTR"/> of
                this document.</t>
              </list></t>

            <t>Calc-Type: value from 0 to 127 inclusive from the "IGP
            Algorithm Types" registry defined under "Interior Gateway Protocol
            (IGP) Parameters" IANA registries. IGP algorithms in the range of
            0-127 have a defined triplet (Calculation Type, Metric,
            Constraints). When used to specify the Calc-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.</t>

            <t>Priority: Value between 0 and 255 inclusive that specifies the
            priority of the advertisement. Numerically greater values are preferred.</t>

            <t>Sub-TLVs - optional sub-TLVs.</t>
          </list></t>

        <t>The IS-IS FAD Sub-TLV MAY be advertised in an LSP of any number. 
        IS-IS router MAY advertise more than one IS-IS FAD Sub-TLV for a given
        Flexible-Algorithm (see <xref target="ISISFADLTLVS"/>).</t>

        <t>The IS-IS FAD Sub-TLV has an area scope. The Router Capability TLV
        in which the FAD Sub-TLV is present MUST have the S-bit clear.</t>

        <t>An IS-IS L1/L2 router MAY be configured to re-generate the winning FAD
        from level 2, without any modification to it, to the level 1 area. The
        re-generation 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
        the level 2. In such a case, the re-generated FAD Sub-TLV will be
        advertised in the level 1 Router Capability TLV originated by the
        L1/L2 router.</t>

        <t>An L1/L2 router MUST NOT re-generate any FAD Sub-TLV from level 1 to
        level 2.</t>
      </section>

      <section anchor="OSPFFLEXALGTLV"
               title="OSPF Flexible Algorithm Definition TLV">
        <t>The OSPF FAD TLV is advertised as a top-level TLV of the Router Information (RI)
        LSA that is defined in <xref target="RFC7770"/>.</t>

        <t>The OSPF FAD TLV has the following format: <figure>
            <artwork><![CDATA[ 

   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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 16</t>

            <t>Length: variable, dependent on the included Sub-TLVs</t>

            <t>Flex-Algorithm:: Flex-Algorithm number. Value between 128 and
            255 inclusive.</t>

            <t>Metric-Type: Type of metric to be used during the calculation.
            The following values are defined: <list style="hanging">
                <t>0: IGP Metric</t>

                <t>1: Min Unidirectional Link Delay as defined in <xref
                target="RFC7471"/>, section 4.2, encoded as application
                specific link attribute as specified in <xref
                target="RFC8920"/> and <xref target="FLEXALGLINKATTR"/> of
                this document.</t>

                <t>2: Traffic Engineering metric as defined in <xref
                target="RFC3630"/>, section 2.5.5, encoded as application
                specific link attribute as specified in <xref
                target="RFC8920"/> and <xref target="FLEXALGLINKATTR"/> of
                this document.</t>
              </list></t>

            <t>Calc-Type: as described in <xref target="ISISFLEXALGTLV"/></t>

            <t>Priority: as described in <xref target="ISISFLEXALGTLV"/></t>

            <t>Sub-TLVs - optional sub-TLVs.</t>
          </list></t>

        <t>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 Router Information LSA. If the OSPF FAD
        TLV, for the same Flex-Algorithm, appears in multiple Router
        Information LSAs that have different flooding scopes, the OSPF FAD TLV
        in the Router Information LSA with the area-scoped flooding scope MUST
        be used. If the OSPF FAD TLV, for the same algorithm, appears in
        multiple Router Information LSAs that have the same flooding scope,
        the OSPF FAD TLV in the Router Information (RI) LSA with the
        numerically smallest Instance ID MUST be used and subsequent instances
        of the OSPF FAD TLV MUST be ignored.</t>

        <t>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
        Autonomous System flooding scope SHOULD NOT be used by default unless
        local configuration policy on the originating router indicates domain
        wide flooding.</t>
      </section>

      <section anchor="COMMONLEXALGTLV"
               title="Common Handling of Flexible Algorithm Definition TLV">
        <t>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.</t>

        <t>The value of the Flex-Algorithm MUST be between 128 and 255
        inclusive. If it is not, the FAD TLV MUST be ignored.</t>

        <t>Only a subset of the routers participating in the particular
        Flex-Algorithm need to advertise the definition of the
        Flex-Algorithm.</t>

        <t>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: <list>
            <t>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.</t>

            <t>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 <xref target="ISO10589"/>. For OSPFv2 and OSPFv3,
            standard Router ID is described in <xref target="RFC2328"/> and
            <xref target="RFC5340"/> respectively.</t>
          </list></t>
          
        <t>The FAD selected according to these rules is also known as the 
  		"winning FAD".</t>

        <t>A router that is not configured to participate in a particular
        Flex-Algorithm MUST ignore FAD Sub-TLVs advertisements for such
        Flex-Algorithm.</t>

        <t>A router that is not participating in a particular Flex-Algorithm
        is allowed to advertise 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.</t>

        <t>Any change in the Flex-Algorithm definition may result in 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.</t>

        <t>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 <xref
        target="FLEXALGPART"/> and it MUST remove any forwarding state
        associated with it.</t>

        <t>Flex-Algorithm definition is topology independent. It applies to
        all topologies that a router participates in.</t>
        
      </section>
    </section>

    <section anchor="ISISFADLTLVS" title="Sub-TLVs of IS-IS FAD Sub-TLV">
    
    <t>One of the limitations of IS-IS <xref target="ISO10589"/> 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) which 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 a cases, the FAD may be split into multiple such sub-TLVs and the content of 
    the multiple FAD sub-TLVs combined to provide a complete FAD for the Flex-Algorithm. 
    In such a case, the fixed portion of the FAD (see <xref target="ISISFLEXALGTLV"/>) 
    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.</t>
       
    <t>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.</t>

    
      <section anchor="ISISFLEXALGEXLTLV"
               title="IS-IS Flexible Algorithm Exclude Admin Group Sub-TLV">
        <t>The Flexible Algorithm definition can specify 'colors' that are
        used by the operator to exclude links during the Flex-Algorithm path
        computation.</t>

        <t>The IS-IS Flexible Algorithm Exclude Admin Group Sub-TLV is used to
        advertise the exclude rule that is used during the Flex-Algorithm path
        calculation as specified in <xref target="FLEXALGPATHCALC"/>.</t>

        <t>The IS-IS Flexible Algorithm Exclude Admin Group Sub-TLV (FAEAG
        Sub-TLV) is a Sub-TLV of the IS-IS FAD Sub-TLV. It has the following
        format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 1</t>

            <t>Length: variable, dependent on the size of the Extended Admin
            Group. MUST be a multiple of 4 octets.</t>

            <t>Extended Administrative Group: Extended Administrative Group as
            defined in <xref target="RFC7308"/>.</t>
          </list></t>

        <t>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.</t>
        
        <t>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.</t>
    
    
      </section>

      <section anchor="ISISFLEXALGINCANYTLV"
               title="IS-IS Flexible Algorithm Include-Any Admin Group Sub-TLV">
        <t>The Flexible Algorithm definition can specify 'colors' that are
        used by the operator to include links during the Flex-Algorithm path
        computation.</t>

        <t>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 <xref target="FLEXALGPATHCALC"/>.</t>

        <t>The format of the IS-IS Flexible Algorithm Include-Any Admin Group
        Sub-TLV is identical to the format of the FAEAG Sub-TLV in <xref
        target="ISISFLEXALGEXLTLV"/>.</t>

        <t>The IS-IS Flexible Algorithm Include-Any Admin Group Sub-TLV Type is
        2.</t>

        <t>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.</t>
        
        <t>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.</t>
        
      </section>

      <section anchor="ISISFLEXALGINCALLTLV"
               title="IS-IS Flexible Algorithm Include-All Admin Group Sub-TLV">
        <t>The Flexible Algorithm definition can specify 'colors' that are
        used by the operator to include links during the Flex-Algorithm path
        computation.</t>

        <t>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 <xref target="FLEXALGPATHCALC"/>.</t>

        <t>The format of the IS-IS Flexible Algorithm Include-All Admin Group
        Sub-TLV is identical to the format of the FAEAG Sub-TLV in <xref
        target="ISISFLEXALGEXLTLV"/>.</t>

        <t>The IS-IS Flexible Algorithm Include-All Admin Group Sub-TLV Type is
        3.</t>

        <t>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.</t>
        
        <t>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.</t>
        
      </section>

      <section anchor="ISISFLEXALGFLAG"
               title="IS-IS Flexible Algorithm Definition Flags Sub-TLV">
        <t>The IS-IS Flexible Algorithm Definition Flags Sub-TLV (FADF Sub-TLV)
        is a Sub-TLV of the IS-IS FAD Sub-TLV. It has the following format:
        <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 4</t>

            <t>Length: variable, number of octets of the Flags field</t>

            <t>Flags: <figure>
                <artwork><![CDATA[ 
              0 1 2 3 4 5 6 7...
             +-+-+-+-+-+-+-+-+...
             |M| | |          ...
             +-+-+-+-+-+-+-+-+...
            ]]></artwork>
              </figure> <list style="hanging">
                <t>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.</t>
              </list></t>
          </list></t>

        <t>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 so as to minimize the number of bits that will
        need to be transmitted.</t>

        <t>Undefined bits MUST be transmitted as 0.</t>

        <t>Bits that are NOT transmitted MUST be treated as if they are set to
        0 on receipt.</t>

        <t>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.</t>
        
        <t>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.</t>

        <t>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.</t>
        
        <t>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.</t>
        
        <t>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.</t>      
        
      </section>

      <section anchor="ISISFLEXALGEXSRLGTLV"
               title="IS-IS Flexible Algorithm Exclude SRLG Sub-TLV">
        <t>The Flexible Algorithm definition can specify Shared Risk Link
        Groups (SRLGs) that the operator wants to exclude during the
        Flex-Algorithm path computation.</t>

        <t>The IS-IS Flexible Algorithm Exclude SRLG Sub-TLV (FAESRLG) is used
        to advertise the exclude rule that is used during the Flex-Algorithm
        path calculation as specified in <xref target="FLEXALGPATHCALC"/>.</t>

        <t>The IS-IS FAESRLG Sub-TLV is a Sub-TLV of the IS-IS FAD Sub-TLV. It
        has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 5</t>

            <t>Length: variable, dependent on number of SRLG values. MUST be a
            multiple of 4 octets.</t>

            <t>Shared Risk Link Group Value: SRLG value as defined in <xref
            target="RFC5307"/>.</t>
          </list></t>
                
        <t>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.</t>
        
        <t>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 which 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.</t>
        
        
      </section>
    </section>

    <section anchor="OSPFFADLTLVS" title="Sub-TLVs of OSPF FAD TLV">
      <section anchor="OSPFFLEXALGEXLTLV"
               title="OSPF Flexible Algorithm Exclude Admin Group Sub-TLV">
        <t>The Flexible Algorithm Exclude Admin Group Sub-TLV (FAEAG Sub-TLV)
        is a Sub-TLV of the OSPF FAD TLV. Its usage is described in <xref
        target="ISISFLEXALGEXLTLV"/>. It has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 1</t>

            <t>Length: variable, dependent on the size of the Extended Admin
            Group. MUST be a multiple of 4 octets.</t>

            <t>Extended Administrative Group: Extended Administrative Group as
            defined in <xref target="RFC7308"/>.</t>
          </list></t>

        <t>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.</t>
      </section>

      <section anchor="OSPFFLEXALGINCANYTLV"
               title="OSPF Flexible Algorithm Include-Any Admin Group Sub-TLV">
        <t>The usage of this Sub-TLVs is described in <xref
        target="ISISFLEXALGINCANYTLV"/>.</t>

        <t>The format of the OSPF Flexible Algorithm Include-Any Admin Group
        Sub-TLV is identical to the format of the OSPF FAEAG Sub-TLV in <xref
        target="OSPFFLEXALGEXLTLV"/>.</t>

        <t>The OSPF Flexible Algorithm Include-Any Admin Group Sub-TLV Type is
        2.</t>

        <t>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.</t>
      </section>

      <section anchor="OSPFFLEXALGINCALLTLV"
               title="OSPF Flexible Algorithm Include-All Admin Group Sub-TLV">
        <t>The usage of this Sub-TLVs is described in <xref
        target="ISISFLEXALGINCALLTLV"/>.</t>

        <t>The format of the OSPF Flexible Algorithm Include-All Admin Group
        Sub-TLV is identical to the format of the OSPF FAEAG Sub-TLV in <xref
        target="OSPFFLEXALGEXLTLV"/>.</t>

        <t>The OSPF Flexible Algorithm Include-All Admin Group Sub-TLV Type is
        3.</t>

        <t>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.</t>
      </section>

      <section anchor="OSPFFLEXALGFLAG"
               title="OSPF Flexible Algorithm Definition Flags Sub-TLV">
        <t>The OSPF Flexible Algorithm Definition Flags Sub-TLV (FADF Sub-TLV)
        is a Sub-TLV of the OSPF FAD TLV. It has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 4</t>

            <t>Length: variable, dependent on the size of the Flags field.
            MUST be a multiple of 4 octets.</t>

            <t>Flags: <figure>
                <artwork><![CDATA[ 
              0 1 2 3 4 5 6 7...
             +-+-+-+-+-+-+-+-+...
             |M| | |          ...
             +-+-+-+-+-+-+-+-+...
            ]]></artwork>
              </figure> <list style="hanging">
                <t>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.</t>
              </list></t>
          </list></t>

        <t>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 so as to minimize the number of bits that will
        need to be transmitted.</t>

        <t>Undefined bits MUST be transmitted as 0.</t>

        <t>Bits that are NOT transmitted MUST be treated as if they are set to
        0 on receipt.</t>

        <t>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.</t>

        <t>If the OSPF FADF Sub-TLV is not present inside the OSPF FAD TLV,
        all the bits are assumed to be set to 0.</t>
        
        <t>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.</t>
        
        <t>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.</t>       
        
      </section>

      <section anchor="OSPFFLEXALGEXSRLGTLV"
               title="OSPF Flexible Algorithm Exclude SRLG Sub-TLV">
        <t>The OSPF Flexible Algorithm Exclude SRLG Sub-TLV (FAESRLG Sub-TLV)
        is a Sub-TLV of the OSPF FAD TLV. Its usage is described in <xref
        target="ISISFLEXALGEXSRLGTLV"/>. It has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 5</t>

            <t>Length: variable, dependent on the number of SRLGs. MUST be a
            multiple of 4 octets.</t>

            <t>Shared Risk Link Group Value: SRLG value as defined in <xref
            target="RFC4203"/>.</t>
          </list></t>

        <t>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.</t>
      </section>
    </section>

    <section anchor="ISISFLEXMETRIC"
             title="IS-IS Flexible Algorithm Prefix Metric Sub-TLV">
      <t>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.</t>

      <t>The IS-IS FAPM Sub-TLV is a sub-TLV of TLVs 135, 235, 236, and 237 and
      has the following format: <figure>
          <artwork><![CDATA[ 
 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:
    ]]></artwork>
        </figure> <list style="hanging">
          <t>Type: 6</t>

          <t>Length: 5 octets</t>

          <t>Flex-Algorithm: Single octet value between 128 and 255
          inclusive.</t>

          <t>Metric: 4 octets of metric information</t>
        </list></t>

      <t>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.</t>

      <t>If a prefix is advertised with a Flex-Algorithm prefix metric larger
      then MAX_PATH_METRIC as defined in <xref target="RFC5305"/> this prefix
      MUST NOT be considered during the Flexible-Algorithm computation.</t>

      <t>The usage of the Flex-Algorithm prefix metric is described in <xref
      target="FLEXALGPATHCALC"/>.</t>

      <t>The IS-IS FAPM Sub-TLV MUST NOT be advertised as a sub-TLV of the IS-IS
      SRv6 Locator TLV <xref target="I-D.ietf-lsr-isis-srv6-extensions"/>. 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.</t>
    </section>

    <section anchor="OSPFFLEXMETRIC"
             title="OSPF Flexible Algorithm Prefix Metric Sub-TLV">
      <t>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.</t>

      <t>The OSPF Flex-Algorithm Prefix Metric (FAPM) Sub-TLV is a Sub-TLV of
      the: <list style="hanging">
          <t>- OSPFv2 Extended Prefix TLV <xref target="RFC7684"/></t>

          <t>- Following OSPFv3 TLVs as defined in <xref target="RFC8362"/>:
          <list style="hanging">
              <t>Inter-Area Prefix TLV</t>

              <t>External Prefix TLV</t>
            </list></t>
        </list></t>

      <t>OSPF FAPM Sub-TLV has the following format: <figure>
          <artwork><![CDATA[ 
 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:
    ]]></artwork>
        </figure> <list style="hanging">
          <t>Type: 3 for OSPFv2, 26 for OSPFv3</t>

          <t>Length: 8 octets</t>

          <t>Flex-Algorithm: Single octet value between 128 and 255
          inclusive.</t>

          <t>Flags: One octet value <figure>
              <artwork><![CDATA[ 
              0 1 2 3 4 5 6 7
             +-+-+-+-+-+-+-+-+
             |E|             |
             +-+-+-+-+-+-+-+-+
            ]]></artwork>
            </figure> <list style="hanging">
              <t>E bit : position 0: The type of external metric. If bit is
              set, the metric specified is a Type 2 external metric. This bit
              is applicable only to OSPF External and NSSA external prefixes.
              This is semantically the same as E bit in section A.4.5 of <xref
              target="RFC2328"/> and section A.4.7 of <xref target="RFC5340"/>
              for OSPFv2 and OSPFv3 respectively.</t>

              <t>Bits 1 through 7: MUST be cleared by sender and ignored by
              receiver.</t>
            </list></t>

          <t>Reserved: Must be set to 0, ignored at reception.</t>

          <t>Metric: 4 octets of metric information</t>
        </list></t>

      <t>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.</t>

      <t>The usage of the Flex-Algorithm prefix metric is described in <xref
      target="FLEXALGPATHCALC"/>.</t>
    </section>

    <section anchor="OSPFASBR"
             title="OSPF Flexible Algorithm ASBR Reachability Advertisement">
      <t>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 metric for
      ASBRs is similarly required for Flex-Algorithm external prefix
      computations as described further in <xref
      target="FLEXALGPATHCALCINTER"/>.</t>

      <section anchor="OSPFEXTASBRLSA"
               title="OSPFv2 Extended Inter-Area ASBR LSA">
        <t>The OSPFv2 Extended Inter-Area ASBR (EIA-ASBR) LSA is an OSPF
        Opaque LSA <xref target="RFC5250"/> 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 <xref target="RFC2328"/>. Unlike the Type 4
        Summary LSA, the 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.</t>

        <t>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.</t>

        <t>The OSPFv2 EIA-ASBR LSA has the following format: <figure>
            <artwork><![CDATA[ 
   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                             -+
  |                             ...                               |

]]></artwork>
          </figure></t>

        <t>The Opaque Type used by the OSPFv2 EIA-ASBR LSA is TBD1 (suggested
        value 11). The Opaque Type is used to differentiate the various types
        of OSPFv2 Opaque LSAs and is described in Section 3 of <xref
        target="RFC5250"/>. The LS Type MUST be 10, indicating that the Opaque
        LSA flooding scope is area-local <xref target="RFC5250"/>. 
        The Length field is as defined in [RFC2328] Section A.4.1. It represents
        the total length (in octets) of the Opaque LSA, including the LSA header 
        and all TLVs (including padding).</t>

        <t>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.</t>

        <t>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 <xref target="RFC3630"/>. 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.</t>

        <section anchor="OSPFEXTASBRTLV"
                 title="OSPFv2 Extended Inter-Area ASBR TLV">
          <t>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.</t>

          <t>The OSPFv2 EIA-ASBR TLV has the following format:</t>

          <t><figure>
              <artwork><![CDATA[   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:

]]></artwork>
            </figure></t>

          <t><list style="hanging">
              <t>Type: 1</t>

              <t>Length: variable</t>

              <t>ASBR Router ID: four octets carrying the OSPF Router ID of
              the ASBR whose information is being carried.</t>

              <t>Sub-TLVs : variable</t>
            </list></t>

          <t>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.</t>

          <t>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.</t>
        </section>
      </section>

      <section anchor="OSPFFAASBRMETRIC"
               title="OSPF Flexible Algorithm ASBR Metric Sub-TLV">
        <t>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.</t>

        <t>The OSPF Flex-Algorithm ASBR Metric (FAAM) Sub-TLV is a Sub-TLV of
        the: <list style="hanging">
            <t>- OSPFv2 Extended Inter-Area ASBR TLV as defined in <xref
            target="OSPFEXTASBRTLV"/></t>

            <t>- OSPFv3 Inter-Area-Router TLV defined in <xref
            target="RFC8362"/></t>
          </list></t>

        <t>OSPF FAAM Sub-TLV has the following format: <figure>
            <artwork><![CDATA[ 
 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:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type: 1 for OSPFv2, TBD2 (suggested value 30) for OSPFv3</t>

            <t>Length: 8 octets</t>

            <t>Flex-Algorithm: Single octet value between 128 and 255
            inclusive.</t>

            <t>Reserved: Three octets. Must be set to 0, ignored at reception.</t>

            <t>Metric: 4 octets of metric information</t>
          </list></t>

        <t>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.</t>

        <t>The advertisement of the ASBR reachability using the OSPF FAAM
        Sub-TLV inside the OSPFv2 EIA-ASBR LSA follows Section 12.4.3 of
        <xref target="RFC2328"/> and inside the OSPFv3 E-Inter-Area-Router LSA
        follows Section 4.8.5 of <xref target="RFC5340"/>. The
        reachability of the ASBR is evaluated in the context of the specific
        Flex-Algorithm.</t>

        <t>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 other 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.</t>

        <t>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.</t>

        <t>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.</t>

        <t>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 instead as specified in
        section 16.2 of <xref target="RFC2328"/> and section 4.8.5 of <xref
        target="RFC5340"/> for OSPFv2 and OSPFv3 respectively.</t>

        <t>The processing of a new or changed OSPF FAAM Sub-TLV triggers the
        processing of External routes similar to what is described in
        section 16.5 of the <xref target="RFC2328"/> for OSPFv2 and section
        4.8.5 of <xref target="RFC5340"/> for OSPFv3 for the specific
        Flex-Algorithm. The External and NSSA External route calculation
        should be limited to Flex-Algorithm(s) for which the winning FAD(s)
        includes the M-flag.</t>

        <t>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.</t>
      </section>
    </section>

    <section anchor="FLEXALGPART"
             title="Advertisement of Node Participation in a Flex-Algorithm">
      <t>When a router is configured to support a particular Flex-Algorithm,
      we say it is participating in that Flex-Algorithm.</t>

      <t>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).</t>

      <section anchor="FLEXALGPARTSR"
               title="Advertisement of Node Participation for Segment Routing">
        <t><xref target="RFC8667"/>, <xref target="RFC8665"/>, and <xref
        target="RFC8666"/> (IGP Segment Routing extensions) describe how the
        SR-Algorithm is used to compute the IGP best path.</t>

        <t>Routers advertise the 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).</t>

        <t>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.</t>
      </section>

      <section anchor="FLEXALGPARTOTHER"
               title="Advertisement of Node Participation for Other Data-planes">
        <t>This section describes considerations related to how other
        data-planes can advertise their participation in a specific
        Flex-Algorithm.</t>

        <t>Data-plane specific Flex-Algorithm participation advertisements
        MAY be topology specific or MAY be topology independent, depending on
        the data-plane itself.</t>

        <t>Data-plane specific advertisement for Flex-Algorithm participation
        MUST be defined for each data-plane and is outside of the scope of
        this document.</t>
      </section>
    </section>

    <section anchor="FLEXALGLINKATTR"
             title="Advertisement of Link Attributes for Flex-Algorithm">
      <t>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
      <xref target="ISISFADLTLVS"/> and <xref target="OSPFFADLTLVS"/>.</t>

      <t>Application-specific link attributes, as specified in 
      <xref target="RFC8919"/> or <xref target="RFC8920"/>, 
      that are to be used during Flex-Algorithm calculation MUST use the 
      Application-Specific Link Attribute (ASLA) advertisements defined in
      <xref target="RFC8919"/> or  <xref target="RFC8920"/>, 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 are to be used, subject to the procedures and constraints defined in 
      [<xref target="RFC8919"/> Section 4.2 and Section 6.</t>

      <t>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.</t>

      <t>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 <xref
      target="RFC8919"/> or <xref target="RFC8920"/>: <list style="hanging">
          <t>Bit-3: Flexible Algorithm (X-bit)</t>
        </list></t>

      <t>ASLA Admin Group Advertisements to be used by the Flexible Algorithm
      application MAY use either the Administrative Group or Extended
      Administrative Group encodings.</t>
      
      <t>A receiver supporting this specification MUST accept both ASLA 
      Administrative Group and Extended Administrative Group TLVs as defined in
      <xref target="RFC8919"/> or <xref target="RFC8920"/>. In the case of IS-IS, if 
      the L-Flag is set in ASLA advertisement, as defined in <xref target="RFC8919"/> 
      Section 4.2, then the receiver MUST be able to accept both Administrative Group TLV 
      as defined in <xref target="RFC5305"/> and Extended Administrative Group TLV as 
      defined in <xref target="RFC7308"/>.</t>  
      
      </section>    

    <section anchor="FLEXALGPATHCALC"
             title="Calculation of Flexible Algorithm Paths">
      <t>A router MUST be configured to participate in a given Flex-Algorithm
      K and MUST select the FAD based on the rules defined in <xref
      target="COMMONLEXALGTLV"/> before it can compute any path for that
      Flex-Algorithm.</t>
      
      <t>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.</t>

      <t>As described in <xref target="FLEXALGPART"/>, 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.</t>
      
      <t>Multiple data-planes MAY use the same Flex-Algorithm value at the
      same time, and and as such, share the FAD for it. Traffic for each data-plane
      will be forwarded based on the data-plane specific forwarding entries.</t>
      
      <t>Flex-Algorithm definition is data-plane independent and is used by
      all Flex-Algorithm data-planes.</t>

      <t>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.</t>

      <t>When computing the path for a given Flex-Algorithm, the metric-type
      that is part of the Flex-Algorithm definition (<xref
      target="FLEXALGDEF"/>) MUST be used.</t>

      <t>When computing the path for a given Flex-Algorithm, the
      calculation-type that is part of the Flex-Algorithm definition (<xref
      target="FLEXALGDEF"/>) MUST be used.</t>

      <t>Various link 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'.</t>

      <t>Rules, in the order as specified below, MUST be used to prune links
      from the topology during the Flex-Algorithm computation.</t>

      <t>For all links in the topology: <list style="hanging">
          <t>1. Check if any exclude AG 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.</t>

          <t>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.</t>

          <t>3. Check if any include-any AG 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.</t>

          <t>4. Check if any include-all AG 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.</t>

          <t>5. If the Flex-Algorithm definition uses other than IGP metric
          (<xref target="FLEXALGDEF"/>), 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.</t>
        </list></t>

      <section anchor="FLEXALGPATHCALCINTER"
               title="Multi-area and Multi-domain Considerations">
        <t>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 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 sub-optimal
        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 may be dropped by the ABR/ASBR.</t>

        <t>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 <xref target="ISISFLEXMETRIC"/> and <xref
        target="OSPFFLEXMETRIC"/>. For external route calculation for prefixes
        originated by ASBRs in remote areas in OSPF, the FAAM has been defined
        in <xref target="OSPFFAASBRMETRIC"/> for the ABR to indicate its ASBR
        reachability along with the metric for the specific
        Flex-Algorithm.</t>

        <t>If the FAD selected based on the rules defined in <xref
        target="COMMONLEXALGTLV"/> includes the M-flag, an ABR or ASBR MUST
        include the FAPM (<xref target="ISISFLEXMETRIC"/>, <xref
        target="OSPFFLEXMETRIC"/>) 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.</t>

        <t>If the FAD selected based on the rules defined in <xref
        target="COMMONLEXALGTLV"/> 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.</t>

        <t>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 <xref
        target="COMMONLEXALGTLV"/> includes the M-Flag, as described in (<xref
        target="ISISFLEXALGFLAG"/> or <xref target="OSPFFLEXALGFLAG"/>).</t>

        <t>In the case of OSPF, when calculating external routes in a
        Flex-Algorithm (with FAD selected includes the M-Flag) where the
        advertising ASBR is in a remote area, the metric will be the sum of
        the following:<list style="symbols">
            <t>the FAPM for that Flex-Algorithm advertised with the external
            route by the ASBR</t>

            <t>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</t>

            <t>the Flex-Algorithm specific metric to reach the local ABR</t>
          </list>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.</t>

        <t>If the FAD selected based on the rules defined in <xref
        target="COMMONLEXALGTLV"/> does not includes 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.</t>

        <t>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-Algoritm traffic for such prefix towards the ABR or ASBR may
        result in traffic looping or persistent traffic drop.</t>

        <t>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 4,294,967,295 during the computation and
        advertised as such.</t>

        <t>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.</t>

        <t>The M-flag in the FAD is not applicable to prefixes advertised as SRv6
        locators. The IS-IS SRv6 Locator TLV <xref
        target="I-D.ietf-lsr-isis-srv6-extensions"/> 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.</t>

        <t>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.</t>

        <t>In OSPF, the procedures for translation of NSSA external prefix
        advertisements into external prefix advertisements performed by an
        NSSA ABR <xref target="RFC3101"/> 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.</t>
        
        <t>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.</t>
        
      </section>
    </section>

    <section anchor="FLEXALFORW" title="Flex-Algorithm and Forwarding Plane">
      <t>This section describes how Flex-Algorithm paths are used in
      forwarding.</t>

      <section anchor="FLEXALGPSRFORW"
               title="Segment Routing MPLS Forwarding for Flex-Algorithm">
        <t>This section describes how Flex-Algorithm paths are used with SR
        MPLS forwarding.</t>

        <t>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 which 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.</t>

        <t>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.</t>

        <t>Traffic that is supposed to be routed via Flex-Algorithm specific
        paths, MUST be dropped when there are no such paths available.</t>

        <t>Loop Free Alternate (LFA) paths (<xref target="RFC6571"/> 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.</t>

        <t>If LFA protection is being used to protect a given Flex-Algorithm
        paths, 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.</t>
      </section>

      <section anchor="FLEXALGPSRV6FORW"
               title="SRv6 Forwarding for Flex-Algorithm">
        <t>This section describes how Flex-Algorithm paths are used with SRv6
        forwarding.</t>

        <t>In SRv6 a node is provisioned with a (topology, algorithm) specific
        locators for each of the topology/algorithm pairs supported by that
        node. Each locator is an aggregate prefix for all SIDs provisioned on
        that node which have the matching topology/algorithm.</t>

        <t>The SRv6 locator advertisement in IS-IS <xref
        target="I-D.ietf-lsr-isis-srv6-extensions"/> includes the MTID value
        that associates the locator with a specific topology. SRv6 locator
        advertisements also includes 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.</t>

        <t>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.</t>

        <t>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.</t>

        <t>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.</t>
      </section>

      <section anchor="FLEXALGPSRFORWOTHER"
               title="Other Data-planes' Forwarding for Flex-Algorithm">
        <t>Any data-plane that wants to use Flex-Algorithm specific
        forwarding needs to install some form of Flex-Algorithm specific
        forwarding entries.</t>

        <t>Data-plane specific forwarding for Flex-Algorithm MUST be defined
        for each data-plane and is outside of the scope of this document.</t>
      </section>
    </section>

    <section title="Operational Considerations">
      <section title="Inter-area Considerations">
        <t>The scope of the Flex-Algorithm computation is an area, so is the scope of the
        FAD. 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 of the level in which it was originated. Even though in OSPF
        the FAD Sub-TLV can be flooded in an RI LSA that has AS flooding
        scope, the FAD selection is performed for each individual area in
        which it is being used.</t>

        <t>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.</t>

        <t>As described in <xref target="ISISFLEXALGTLV"/>, IS-IS allows the
        re-generation 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 the 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-Algoritm is advertised.</t>

        <t>Re-generation 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 router(s) that are in level 2.
        In OSPF, the FAD definition can be done in any area and be propagated
        to all routers in the OSPF routing domain by using the AS flooding
        scope of the RI LSA.</t>
      </section>

      <section title="Usage of SRLG Exclude Rule with Flex-Algorithm">
        <t>There are two different ways in which SRLG information can be used
        with Flex-Algorithm: <list style="hanging">
            <t>In a context of a single Flex-Algorithm, it can be used for
            computation of backup paths, as described in <xref
            target="I-D.ietf-rtgwg-segment-routing-ti-lfa"/>. This usage does
            not require association of any specific SRLG constraint with the
            given Flex-Algorithm definition.</t>

            <t>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: <list
                style="hanging">
                <t>Facilitates the usage of already deployed SRLG
                configurations for setup of disjoint paths between two or more
                Flex-Algorithms.</t>

                <t>Requires explicit association of a given Flex-Algorithm
                with a specific set of SRLG constraints as defined in <xref
                target="ISISFLEXALGEXSRLGTLV"/> and <xref
                target="OSPFFLEXALGEXSRLGTLV"/>.</t>
              </list></t>
          </list></t>

        <t>The two usages mentioned above are orthogonal.</t>
      </section>

      <section title="Max-metric consideration">
        <t>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 non-reachable or to 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.</t>

        <t>The link can be made un-reachable for all Flex-Algorithms that use
        Min Unidirectional Link Delay as metric, as described in <xref
        target="ISISFLEXALGTLV"/>, 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^24 - 1).</t>

        <t>The link can be made un-reachable for all Flex-Algorithms that use
        TE metric, as described in <xref target="ISISFLEXALGTLV"/>, 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^24 - 1) in IS-IS and (2^32 - 1) in OSPF.</t>
      </section>
    </section>

    <section title="Backward Compatibility">
      <t>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.</t>
    </section>

    <section title="Security Considerations">
      <t>This draft adds two new ways to disrupt IGP networks: <list
          style="hanging">
          <t>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).</t>

          <t>An attacker could make it look like a router supports a
          particular Flex-Algorithm when it actually doesn't, or vice
          versa.</t>
        </list></t>

      <t>Both of these attacks can be addressed by the existing security
      extensions as described in <xref target="RFC5304"/> and <xref
      target="RFC5310"/> for IS-IS, in <xref target="RFC2328"/> and <xref
      target="RFC7474"/> for OSPFv2, and in <xref target="RFC5340"/> and <xref
      target="RFC4552"/> for OSPFv3.</t>
    </section>

    <section anchor="IANA" title="IANA Considerations">
      <section anchor="IANAIGP" title="IGP IANA Considerations">
        <section anchor="IANAIGPIGPALGTYPE"
                 title="IGP Algorithm Types Registry">
          <t>This document makes the following registrations in the "IGP
          Algorithm Types" registry: <list style="hanging">
              <t>Type: 128-255.</t>

              <t>Description: Flexible Algorithms.</t>

              <t>Reference: This document (<xref target="FLEXALG"/>).</t>
            </list></t>
        </section>

        <section title="IGP Metric-Type Registry">
          <t>IANA is requested to set up a registry called "IGP Metric-Type
          Registry" under the "Interior Gateway Protocol (IGP) Parameters" IANA
          grouping. The registration policy for this registry is "Standards
          Action" (<xref target="RFC8126"/> and <xref target="RFC7120"/>).</t>

          <t>Values in this registry come from the range 0-255.</t>

          <t>This document registers following values in the "IGP Metric-Type
          Registry": <list style="hanging">
              <t>Type: 0</t>

              <t>Description: IGP metric</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGTLV"/>)</t>

              <t>Type: 1</t>

              <t>Description: Min Unidirectional Link Delay as defined in
              <xref target="RFC8570"/>, section 4.2, and <xref
              target="RFC7471"/>, section 4.2.</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGTLV"/>)</t>

              <t>Type: 2</t>

              <t>Description: Traffic Engineering Default Metric as defined in
              <xref target="RFC5305"/>, section 3.7, and Traffic engineering
              metric as defined in <xref target="RFC3630"/>, section 2.5.5</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGTLV"/>)</t>
            </list></t>
        </section>
      </section>

      <section anchor="IANAFADFLGAS"
               title="Flexible Algorithm Definition Flags Registry">
        <t>IANA is requested to set up a registry called "IS-IS Flexible
        Algorithm Definition Flags Registry" under the "Interior Gateway
        Protocol (IGP) Parameters" IANA grouping. The registration policy
        for this registry is "Standards Action" (<xref target="RFC8126"/> and
        <xref target="RFC7120"/>). New registrations should be assigned in 
        ascending bit order (see <xref target="ISISFLEXALGFLAG"/>).</t>

        <t>This document defines the following single bit in Flexible
        Algorithm Definition Flags registry: <figure>
            <artwork><![CDATA[
        Bit #   Name
        -----   ------------------------------
        0       Prefix Metric Flag (M-flag)
        
     ]]></artwork>
          </figure></t>

        <t>Reference: This document (<xref target="ISISFLEXALGFLAG"/>, <xref
        target="OSPFFLEXALGFLAG"/>).</t>
      </section>

      <section anchor="IANAISIS" title="IS-IS IANA Considerations">
        <section anchor="SUBTLVS" title="IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV">
          <t>This document makes the following registrations in the 
          "IS-IS Sub-TLVs for IS-IS Router CAPABILITY TLV" registry. <list style="hanging">
              <t>Type: 26.</t>

              <t>Description: Flexible Algorithm Definition (FAD).</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGTLV"/>).</t>
            </list></t>
        </section>

        <section anchor="SUBTLVS135"
                 title="IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability">
          <t>This document makes the following registrations in the 
          "IS-IS Sub-TLVs for TLVs Advertising Prefix Reachability" registry. <list style="hanging">
              <t>Type: 6</t>

              <t>Description: Flexible Algorithm Prefix Metric (FAPM).</t>

              <t>Reference: This document (<xref
              target="ISISFLEXMETRIC"/>).</t>
            </list></t>
        </section>

        <section anchor="SUBTLVREGISTRY"
                 title="Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV">
          <t>This document creates the following Sub-Sub-TLV Registry, under the
  		  	   IS-IS TLV Codepoints grouping. <list style="hanging">
              <t>Registry: Sub-Sub-TLVs for Flexible Algorithm Definition
              Sub-TLV</t>

              <t>Registration Procedure: Expert review. (Note that the IS-IS TLV 
              Codepoints grouping includes Expert Review guidance that applies to 
              all registries thereunder.) </t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGTLV"/>)</t>
            </list></t>

          <t>This document defines the following Sub-Sub-TLVs in the
          "Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV" registry:
          <list style="hanging">
              <t>Type: 1</t>

              <t>Description: Flexible Algorithm Exclude Admin Group</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGEXLTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 2</t>

              <t>Description: Flexible Algorithm Include-Any Admin Group</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGINCANYTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 3</t>

              <t>Description: Flexible Algorithm Include-All Admin Group</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGINCALLTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 4</t>

              <t>Description: Flexible Algorithm Definition Flags</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGFLAG"/>).</t>
            </list> <list style="hanging">
              <t>Type: 5</t>

              <t>Description: Flexible Algorithm Exclude SRLG</t>

              <t>Reference: This document (<xref
              target="ISISFLEXALGEXSRLGTLV"/>).</t>
            </list></t>
        </section>
      </section>

      <section anchor="IANAOSPF" title="OSPF IANA Considerations">
        <section anchor="RITLVREG"
                 title="OSPF Router Information (RI) TLVs Registry">
          <t>This specification makes the following registration in the OSPF 
          Router Information (RI) TLVs Registry. <list style="hanging">
              <t>Type: 16</t>

              <t>Description: Flexible Algorithm Definition (FAD) TLV.</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGTLV"/>).</t>
            </list></t>
        </section>

        <section anchor="SUBTLVEXTPFX"
                 title="OSPFv2 Extended Prefix TLV Sub-TLVs">
          <t>This document makes the following registrations in the "OSPFv2
          Extended Prefix TLV Sub-TLVs" registry. <list style="hanging">
              <t>Type: 3</t>

              <t>Description: Flexible Algorithm Prefix Metric (FAPM).</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXMETRIC"/>).</t>
            </list></t>
        </section>

        <section anchor="SUBTLVV3EXTLSA" title="OSPFv3 Extended-LSA Sub-TLVs">
          <t>This document makes the following registrations in the "OSPFv3
          Extended-LSA Sub-TLVs" registry. <list style="hanging">
              <t>Type: 26</t>

              <t>Description: Flexible Algorithm Prefix Metric (FAPM).</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXMETRIC"/>).</t>

              <t>Type: TBD2 (suggested value 30)</t>

              <t>Description: OSPF Flexible Algorithm ASBR Metric Sub-TLV</t>

              <t>Reference: This document (<xref target="OSPFFAASBRMETRIC"/>).</t>
            </list></t>
        </section>

        <section anchor="FAPMFLAGS"
                 title="OSPF Flex-Algorithm Prefix Metric Bits">
          <t>This specification requests creation of the "OSPF Flex-Algorithm
          Prefix Metric Bits" registry under the under the "Open Shortest Path First 
          (OSPF) Parameters" with the following initial values:</t>

          <t><list style="hanging">
              <t>Bit Number: 0</t>

              <t>Description: E bit - External Type</t>

              <t>Reference: this document (<xref target="OSPFFLEXMETRIC"/>).</t>
            </list>The bits 1-7 are unassigned and the registration procedure
          to be followed for this registry is IETF Review.</t>
        </section>

        <section anchor="OPQLSAOPTS" title="OSPFv2 Opaque LSA Option Types ">
          <t>This document makes the following registrations in the "Opaque Link-State 
          Advertisements (LSA) Option Types" registry under the "Open Shortest Path 
          First v2 (OSPFv2) Parameters" grouping. <list style="hanging">
              
              <t>Value: TBD1 (suggested value 11)</t>

              <t>Description: OSPFv2 Extended Inter-Area ASBR (EIA-ASBR) LSA</t>

              <t>Reference: This document (<xref
              target="OSPFEXTASBRLSA"/>).</t>
            </list></t>
        </section>

        <section anchor="IAASBRTLV"
                 title="OSPFv2 Extended Inter-Area ASBR TLVs">
          <t>This specification requests creation of "OSPFv2 Extended
          Inter-Area ASBR TLVs" registry under the OSPFv2 Parameters Registry
          with the following initial values.</t>

          <t><list style="hanging">
              <t>Value: 1</t>

              <t>Description : Extended Inter-Area ASBR TLV</t>

              <t>Reference: this document</t>
            </list>The values 2 to 32767 are unassigned, values 32768 to 33023
          are reserved for experimental use while the values 0 and 33024 to
          65535 are reserved. The registration procedure to be followed for
          this registry is IETF Review or IESG Approval.</t>
        </section>

        <section anchor="IAASBRSTLV" title="OSPFv2 Inter-Area ASBR Sub-TLVs">
          <t>This specification requests creation of "OSPFv2 Extended
          Inter-Area ASBR Sub-TLVs" registry under the "Open Shortest Path 
          First v2 (OSPFv2) Parameters" grouping, with the following initial values.</t>

          <t><list style="hanging">
              <t>Value: 1</t>

              <t>Description : OSPF Flexible Algorithm ASBR Metric Sub-TLV</t>

              <t>Reference: this document</t>
            </list>The values 2 to 32767 are unassigned, values 32768 to 33023
          are reserved for experimental use while the values 0 and 33024 to
          65535 are reserved. The registration procedure to be followed for
          this registry is IETF Review or IESG Approval.</t>
        </section>

        <section title="OSPF Flexible Algorithm Definition TLV Sub-TLV Registry">
          <t>This document creates the following registry under the "Open Shortest 
  		  	   Path First (OSPF) Parameters" grouping: 
  		  	   <list style="hanging">
              <t>Registry: OSPF Flexible Algorithm Definition TLV sub-TLV</t>

              <t>Registration Procedure: IETF Review or IESG Approval</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGTLV"/>)</t>
            </list></t>

          <t>The "OSPF Flexible Algorithm Definition TLV sub-TLV" registry
          will define sub-TLVs at any level of nesting for the Flexible
          Algorithm TLV  New values can be allocated via IETF Review or IESG Approval.</t>

          <t>This document registers following Sub-TLVs in the "OSPF Flexible Algorithm 
          Definition TLV sub-TLV" registry: <list style="hanging">
              <t>Type: 1</t>

              <t>Description: Flexible Algorithm Exclude Admin Group</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGEXLTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 2</t>

              <t>Description: Flexible Algorithm Include-Any Admin Group</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGINCANYTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 3</t>

              <t>Description: Flexible Algorithm Include-All Admin Group</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGINCALLTLV"/>).</t>
            </list> <list style="hanging">
              <t>Type: 4</t>

              <t>Description: Flexible Algorithm Definition Flags</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGFLAG"/>).</t>
            </list> <list style="hanging">
              <t>Type: 5</t>

              <t>Description: Flexible Algorithm Exclude SRLG</t>

              <t>Reference: This document (<xref
              target="OSPFFLEXALGEXSRLGTLV"/>).</t>
            </list></t>

          <t>Types in the range 32768-33023 are for experimental use; these
          will not be registered with IANA.</t>

          <t>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 covers the range being assigned.</t>
        </section>

        <section title="Link Attribute Applications Registry">
          <t>This document registers following bit in the Link Attribute
          Applications Registry: <list style="hanging">
              <t>Bit-3</t>

              <t>Description: Flexible Algorithm (X-bit)</t>

              <t>Reference: This document (<xref
              target="FLEXALGLINKATTR"/>).</t>
            </list></t>
        </section>
      </section>
    </section>

    <section anchor="ACK" title="Acknowledgements">
      <t>This draft, among other things, is also addressing the problem that
      the <xref target="I-D.gulkohegde-routing-planes-using-sr"/> was trying
      to solve. All authors of that draft agreed to join this draft.</t>

      <t>Thanks to Eric Rosen, Tony Przygienda, William Britto A J, Gunter Van
      De Velde, Dirk Goethals, Manju Sivaji and, Baalajee S for their detailed
      review and excellent comments.</t>

      <t>Thanks to Cengiz Halit for his review and feedback during initial
      phase of the solution definition.</t>

      <t>Thanks to Kenji Kumaki for his comments.</t>

      <t>Thanks to Acee Lindem for editorial comments.</t>
    </section>
  </middle>

  <back>
    <references title="Normative References">
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4203.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5307.xml"?>
      
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7308.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5250.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8920.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8919.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7770.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7981.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7684.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8362.xml"?>
      
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8660.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8665.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8666.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8667.xml"?>
      
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8986.xml"?>

      <reference anchor="ISO10589">
        <front>
          <title>Intermediate system to Intermediate system intra-domain
          routeing information exchange protocol for use in conjunction with
          the protocol for providing the connectionless-mode Network Service
          (ISO 8473)</title>

          <author>
            <organization abbrev="ISO">International Organization for
            Standardization</organization>
          </author>

          <date month="Nov" year="2002"/>
        </front>

        <seriesInfo name="ISO/IEC" value="10589:2002, Second Edition"/>
      </reference>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-lsr-isis-srv6-extensions.xml"?>
    </references>

    <references title="Informative References">
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.2328.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.3630.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.3101.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.3906.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.4552.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5304.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5305.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5310.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.5340.xml"?>
      
      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.6571.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7120.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7471.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.7474.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8570.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml/reference.RFC.8126.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml3/reference.I-D.gulkohegde-routing-planes-using-sr.xml"?>

      <?rfc include="http://xml2rfc.tools.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-rtgwg-segment-routing-ti-lfa.xml"?>
    </references>
  </back>
</rfc>
