<?xml version="1.0" encoding="US-ASCII"?>
<!DOCTYPE rfc SYSTEM "rfc2629.dtd">
<?rfc toc="yes"?>
<?rfc tocompact="yes"?>
<?rfc tocdepth="3"?>
<?rfc tocindent="yes"?>
<?rfc symrefs="yes"?>
<?rfc sortrefs="yes"?>
<?rfc comments="yes"?>
<?rfc inline="yes"?>
<?rfc compact="yes"?>
<?rfc subcompact="no"?>
<rfc category="std" docName="draft-ietf-lsr-igp-flex-algo-reverse-affinity-09" ipr="trust200902">
  <front>
    <title abbrev="Flex-Algorithm Reverse Affinity">IGP Flexible Algorithms Reverse Affinity Constraint</title>

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

      <address>
        <postal>
          <street>Apollo Business Center</street>
          <street>Mlynske nivy 43</street>

          <city>Bratislava</city>

          <code>82109</code>

          <country>Slovakia</country>
        </postal>

        <email>ppsenak@cisco.com</email>
      </address>
    </author>
    
    <author fullname="Jakub Horn" initials="J." surname="Horn">
      <organization>Cisco Systems</organization>

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

          <city>Milpitas</city>

          <code>95035</code>

          <region>CA</region>

          <country>USA</country>
        </postal>

        <email>jakuhorn@cisco.com</email>
      </address>
    </author>
    
    <author fullname="Amit Dhamija" initials="A" surname="Dhamija">
      <organization>Arrcus</organization>

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

        <email>amitd@arrcus.com</email>
      </address>
    </author>
  

    <date/>
    
    
    <area>Routing Area</area>

    <workgroup>LSR Working Group</workgroup>

    <keyword>IGP</keyword>

    <keyword>Draft</keyword>

    <abstract>
    
      <t>An IGP Flexible Algorithm (Flex-Algorithm) enables the computation of 
      constraint-based paths within an IGP domain, allowing operators to influence path 
      selection according to administrative policies. This document defines an extension 
      to Flex-Algorithm that allows the inclusion or exclusion of links from path
      computation based on Administrative Groups (also known as link affinities) 
      associated with the reverse direction of the path under computation.</t> 

      <t>This extension enhances the path selection capabilities of Flex-Algorithm by 
      enabling reverse-affinity-based constraints, which are particularly useful for 
      scenarios where path symmetry or directional link attributes are operationally 
      significant.</t>
      
    </abstract>
  </front>

  <middle>
    <section title="Introduction">
      <t>IGP protocols historically computed the best paths over the network 
      solely based on the IGP metric assigned to the links. An IGP Flex-Algorithm 
      as specified in <xref target="RFC9350"/> allows IGPs to compute constraint-based
      paths. Several mechanisms to include or exclude the link during the Flex-Algorithm 
      path calculation have been defined already:   
      <list style="hanging">
      
     <t> - link inclusion or exclusion based on the presence of a specific Admin Group(s) - 
     <xref target="RFC9350"/></t>
     
     <t> - link exclusion based on the presence of a specific Shared Risk Link Group 
     (SRLG) -  <xref target="RFC9350"/></t> 
     
     <t> - link exclusion based on minimum bandwidth - 
     <xref target="I-D.ietf-lsr-flex-algo-bw-con"/></t>
     
     <t> - link exclusion based on maximum delay - 
     <xref target="I-D.ietf-lsr-flex-algo-bw-con"/></t>  
    
    </list></t>
      
      <t>This document extends IGP Flex-Algorithm with additional constraints
      for inclusion or exclusion of links in the path based on Admin Groups	
	  associated with the reverse direction of the SPF path computation.</t>
	  
	  <t>The term OSPF in this document is used to cover both OSPFv2 and OSPFv3 protocols.</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 <xref
      target="RFC2119">BCP 14</xref> <xref target="RFC8174"/> when, and only
      when, they appear in all capitals, as shown here.</t>
    </section>

    <section title="Use Case Example">
       
      <t>The Flexible Algorithm definition (FAD) can specify Extended Administrative Groups that are
      used by the operator to include or exclude links during the Flex-Algorithm path
      computation <xref target="RFC9350"/>. These link Extended Administrative Groups are checked
      in the path direction of the SPF computation, e.g., in the direction from the root 
      vertex toward verticies of increasing distance.</t>
        
      <t>In certain scenarios, it is beneficial to evaluate the Extended Administrative Groups 
      associated with the reverse direction of a link, rather than solely those 
      in the direction of path computation. Consider a point-to-point link represented 
      as a pair of directed edges between two nodes, A and B. When computing a path from
      A to B, issues such as input errors on the link, detectable only at the receiving 
      node B, may be operationally significant. An operator might monitor metrics like 
      CRC errors or other input-related faults at node B and apply thresholds over a 
      defined observation period. If such a threshold is exceeded, node B may locally 
      assign specific Extended Administrative Groups to the link in the direction from 
      B to A.</t>

	  <t>To accommodate this operational intent, the Flex-Algorithm can be extended 
      to inspect the Extended Administrative Groups of the reverse-direction edge (from 
      B to A) when evaluating the forward-direction edge (from A to B) during path
      computation. This enables the exclusion of links from the computed topology 
      based on conditions detected at the far end of the link, improving network 
      reliability and policy control.</t>
      
    </section>
    
    <section title="Deployment Consideration">
    
      <t>Threshold based setting of the link Extended Administrative Groups must be done 
      with care to avoid excessive flooding and constant Flex-Algorithm path 
      re-calculation.</t>
      
      <t>One possible approach is to use two different thresholds when setting and un-setting 
      the Extended Administrative Group on the link. For example, when setting the 
      Extended Administrative Group on the link based on the percentage of certain incoming 
      errors, higher threshold is used for setting and lower threshold is used for 
      un-setting the Extended Administrative Group on the link.</t>
       
      <t>Many implementations provide a throttling mechanism that limits the rate at which 
      the LSP in case of ISIS, or LSA in case of OSPFv2 and OSPFv3, is updated at the 
      originator. Such mechanism is typically not specific to any particular link 
      attribute, but rather considers any change in the LSP or LSA. Usage of such 
      throttling mechanism can also be used to avoid frequent changes in the setting of the 
      Extended Administrative Group on a link to affect the stability of the receivers.</t>
      
    </section>

    <section anchor="ISISFLEXALGEXLTLV"
               title="IS-IS Flexible Algorithm Exclude Reverse Admin Group Sub-TLV">
        
        <t>The IS-IS Flexible Algorithm Exclude Reverse Admin Group (FAERAG) 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 FAERAG 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 octet): 10</t>

            <t>Length (1 octet): Variable, dependent on the size of the Extended Admin
            Group. The length MUST be a multiple of 4 octets. If the length is not 
            a multiple of 4 octets, the entire Sub-TLV MUST be ignored by the receiver.</t>

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

        <t>The IS-IS FAERAG 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 FAERAG 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 set, the IS-IS FAERAG 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
        by the receiver.</t>
    
      </section>
      
      
      
      <section anchor="ISISFLEXALGINCANYTLV"
               title="IS-IS Flexible Algorithm Include-Any Reverse Admin Group Sub-TLV">
       
        <t>The IS-IS Flexible Algorithm Include-Any Reverse 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 Reverse Admin Group
        Sub-TLV is identical to the format of the FAERAG Sub-TLV in 
        <xref target="ISISFLEXALGEXLTLV"/>.</t>

        <t>IANA has assigned Type value of 11 for the IS-IS Flexible Algorithm Include-Any 
        Reverse Admin Group Sub-TLV.</t>

        <t>The IS-IS Flexible Algorithm Include-Any Reverse 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 Reverse 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 set, the IS-IS Flexible Algorithm
        Include-Any Reverse 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 
        by the receiver.</t>
        
      </section>

      <section anchor="ISISFLEXALGINCALLTLV"
               title="IS-IS Flexible Algorithm Include-All Reverse Admin Group Sub-TLV">
        	
	    <t>The IS-IS Flexible Algorithm Include-All Reverse 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 Reverse Admin Group
        Sub-TLV is identical to the format of the FAERAG Sub-TLV in
         <xref target="ISISFLEXALGEXLTLV"/>.</t>

        <t>IANA has assigned Type value of 12 for the IS-IS Flexible Algorithm Include-All 
        Reverse Admin Group Sub-TLV.</t>

        <t>The IS-IS Flexible Algorithm Include-All Reverse 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 Reverse 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 set, the IS-IS Flexible Algorithm 
        Include-All Reverse 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
        by the receiver.</t>
                
      </section>
      
      
      
      <section anchor="OSPFFLEXALGEXLTLV"
               title="OSPF Flexible Algorithm Exclude Reverse Admin Group Sub-TLV">
        
        <t>The OSPF Flexible Algorithm Exclude Reverse Admin Group (FAERAG) 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 OSPF FAERAG 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            |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                      Extended Admin Group                     |
+-                                                             -+
|                            ...                                |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
where:
    ]]></artwork>
          </figure> <list style="hanging">
            <t>Type (2 octets): 10</t>

            <t>Length (2 octets): Variable, dependent on the size of the Extended Admin
            Group. The length MUST be a multiple of 4 octets. If the length is not 
            a multiple of 4 octets, the entire Sub-TLV MUST be ignored by the receiver.</t>

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

        <t>The OSPF FAERAG 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 Reverse Admin Group Sub-TLV">
        
        <t>The OSPF Flexible Algorithm Include-Any Reverse 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 OSPF Flexible Algorithm Include-Any Reverse Admin Group
        Sub-TLV is identical to the format of the OSPF FAERAG Sub-TLV in <xref
        target="OSPFFLEXALGEXLTLV"/>.</t>

        <t>IANA has assigned Type value of 11 for the OSPF Flexible Algorithm Include-Any 
        Reverse Admin Group Sub-TLV.</t>

        <t>The OSPF Flexible Algorithm Include-Any Reverse 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 Reverse Admin Group Sub-TLV">
        
        <t>The OSPF Flexible Algorithm Include-All Reverse 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 OSPF Flexible Algorithm Include-All Reverse Admin Group
        Sub-TLV is identical to the format of the OSPF FAERAG Sub-TLV in <xref
        target="OSPFFLEXALGEXLTLV"/>.</t>

        <t>IANA has assigned Type value of 12 for OSPF Flexible Algorithm Include-All Reverse 
        Admin Group Sub-TLV.</t>

        <t>The OSPF Flexible Algorithm Include-All Reverse 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="FLEXALGPATHCALC"
             title="Calculation of Flexible Algorithm Paths">
             
           
       <t>The following procedures augment the rules defined in Section 13 of 
       <xref target="RFC9350"/> by introducing additional constraints based on 
       Administrative Groups (AGs) associated with the reverse direction of a link. 
        
        <list style="hanging">
       
          <t>Check if any exclude reverse Admin Group rule is part of the Flex-Algorithm
          definition. If such exclude rule exists, check if any Admin Group that is
          part of the exclude rule is also set on the link in the reverse direction. 
          If such Admin Group is set on the link in the reverse direction, the link MUST 
          be pruned from the computation.</t>
          
          <t>Check if any include-any reverse Admin Group rule is part of the Flex-Algorithm
          definition. If such include-any rule exists, check if any Admin Group that
          is part of the include-any rule is also set on the link in the reverse 
          direction. If no such Admin Group is set on the link in the reverse direction, 
          the link MUST be pruned from the computation.</t>

          <t>Check if any include-all reverse Admin Group rule is part of the Flex-Algorithm
          definition. If such include-all rule exists, check if all Admin Groups
          that are part of the include-all rule are also set on the link in the reverse
          direction. If all such Admin Groups are not set on the link in the reverse direction,
          the link MUST be pruned from the computation.</t>
          
          </list></t>
        
        <t>Please see rules 8, 9, and 10 in <xref target="PATHCOMPREGISTRY"/> for these added 
        rules.</t>
          
    </section>     
    
    <section anchor="IANA" title="IANA Considerations">
      
      <section anchor="SUBTLVREGISTRY"
                 title="Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV">
          
          <t>This document makes the following registration in the 
          "IS-IS Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV" registry 
          under "IS-IS TLV Codepoints" registry group:
            <list style="hanging">
              <t>Type: 10</t>

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

              <t>MP-TLV Applicability: N</t>
              
              <t>Reference: This document (<xref
              target="ISISFLEXALGEXLTLV"/>).</t>
            </list> 
            <list style="hanging">
              <t>Type: 11</t>

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

			  <t>MP-TLV Applicability: N</t>
			  
              <t>Reference: This document (<xref
              target="ISISFLEXALGINCANYTLV"/>).</t>
            </list> 
            <list style="hanging">
              <t>Type: 12</t>

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

			  <t>MP-TLV Applicability: N</t>
			  
              <t>Reference: This document (<xref
              target="ISISFLEXALGINCALLTLV"/>).</t>
            </list></t>
            
        </section>
        
       <section title="OSPF Flexible Algorithm Definition TLV Sub-TLV Registry">
        <t>This document makes the following registration in the "OSPF Flexible
           Algorithm Definition TLV Sub-TLVs" registry under "Open Shortest 
           Path First (OSPF) Parameters" registry group:
         <list style="hanging">
              <t>Type: 10</t>

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

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

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

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

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

              <t>Reference: This document (<xref
              target="OSPFFLEXALGINCALLTLV"/>).</t>
            </list></t>
            
          </section> 
  
     <section anchor="PATHCOMPREGISTRY" title="IGP Flex-Algo Path Computation Rules Registry">
         
          <t>This document creates a new registry called "IGP Flex-Algorithm Path Computation 
          Rules Registry" within the "Interior Gateway Protocol (IGP) Parameters" 
          registry group. The registration procedure for the new registry is 
          "Expert Review".</t>
          
          <t>The "IGP Flex-Algo Path Computation Rules" specifies the ordered 
          set of rules that is used to prune links from the topology during 
          the Flex-Algorithm path computation.</t>
          
          <t>There is no upper bound on the number of rules that the registry supports.</t>
          
          <table align="center" pn="table-6">
            <name slugifiedName="name-is-is-sub-sub-tlvs-for-flexi">IGP Flex-algo Path Calculation Rules</name>
            <thead>
              <tr>
                <th align="left" colspan="1" rowspan="1">Sequence Number</th>
                <th align="left" colspan="1" rowspan="1">Description</th>
                <th align="left" colspan="1" rowspan="1">Reference</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left" colspan="1" rowspan="1">1</td>
                <td align="left" colspan="1" rowspan="1">Check if any exclude 
                Administrative Group rule is part of the Flex-Algorithm Definition. 
                If such exclude rule exists, check if any color that is part of the 
                exclude rule is also set on the link. If such a color is set, 
                the link MUST be pruned from the computation</td>
                <td align="left" colspan="1" rowspan="1">Section 13 of <xref target="RFC9350"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">2</td>
                <td align="left" colspan="1" rowspan="1">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.</td>
                <td align="left" colspan="1" rowspan="1">Section 13 of <xref target="RFC9350"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">3</td>
                <td align="left" colspan="1" rowspan="1">Check if any include-any 
                Administrative Group rule is part of the Flex-Algorithm Definition. If 
                such include-any rule exists, check if any color that is part of the 
                include-any rule is also set on the link. If no such color is set, 
                the link MUST be pruned from the computation</td>
                <td align="left" colspan="1" rowspan="1">Section 13 of <xref target="RFC9350"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">4</td>
                <td align="left" colspan="1" rowspan="1">Check if any include-all 
                Administrative Group rule is part of the Flex-Algorithm Definition. 
                If such include-all rule exists, check if all colors that are part 
                of the include-all rule are also set on the link. If all such colors 
                are not set on the link, the link MUST be pruned from the computation.</td>
                <td align="left" colspan="1" rowspan="1">Section 13 of <xref target="RFC9350"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">5</td>
                <td align="left" colspan="1" rowspan="1">If the Flex-Algorithm Definition 
                uses something other than the IGP metric (Section 5 of <xref target="RFC9350"/>), 
                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.</td>
                <td align="left" colspan="1" rowspan="1">Section 13 of <xref target="RFC9350"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">6</td>
                <td align="left" colspan="1" rowspan="1"> Check if any exclude FAEMB 
                rule is part of the Flex-Algorithm definition. If such exclude rule
                 exists and the link has Maximum Link Bandwidth advertised, check if the 
                link bandwidth satisfies the FAEMB rule. If the link does not satisfy the 
                FAEMB rule, the link MUST be pruned from the Flex-Algorithm computation</td>
                <td align="left" colspan="1" rowspan="1">Section 6 of <xref target="I-D.ietf-lsr-flex-algo-bw-con"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">7</td>
                <td align="left" colspan="1" rowspan="1">Check if any exclude FAEMD rule 
                is part of the Flex-Algorithm definition. If such exclude rule exists 
                and the link has Min Unidirectional link delay advertised, check if the 
                link delay satisfies the FAEMD rule. If the link does not satisfy the 
                FAEMD rule, the link MUST be pruned from the Flex-Algorithm computation.</td>
                <td align="left" colspan="1" rowspan="1">Section 6 of <xref target="I-D.ietf-lsr-flex-algo-bw-con"/></td>
              </tr>
              
              <tr>
                <td align="left" colspan="1" rowspan="1">8</td>
                <td align="left" colspan="1" rowspan="1">Check if any exclude 
                reverse Admin Group rule is part of the Flex-Algorithm
                definition. If such exclude rule exists, check if any Admin Group that is
                part of the exclude rule is also set on the link in the reverse direction. 
                If such Admin Group is set on the link in the reverse direction, the link MUST 
                be pruned from the computation.</td>
                <td align="left" colspan="1" rowspan="1">This document, <xref target="FLEXALGPATHCALC"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">9</td>
                <td align="left" colspan="1" rowspan="1">Check if any include-any 
                reverse Admin Group rule is part of the Flex-Algorithm
                definition. If such include-any rule exists, check if any Admin Group that
                is part of the include-any rule is also set on the link in the reverse 
                direction. If no such Admin Group is set on the link in the reverse direction, 
                the link MUST be pruned from the computation</td>
                <td align="left" colspan="1" rowspan="1">This document, <xref target="FLEXALGPATHCALC"/></td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">10</td>
                <td align="left" colspan="1" rowspan="1">Check if any include-all 
                reverse Admin Group rule is part of the Flex-Algorithm
                definition. If such include-all rule exists, check if all Admin Groups
                that are part of the include-all rule are also set on the link in the reverse
                direction. If all such Admin Groups are not set on the link in the reverse direction,
                the link MUST be pruned from the computation.</td>
                <td align="left" colspan="1" rowspan="1">This document,  <xref target="FLEXALGPATHCALC"/></td>
              </tr>
            </tbody>
          </table>
        </section>
        
      <section anchor="GUID_EXP" title="Guidance for Designated Experts">
    
      <t>This section provides the guidance for designated expert on evaluating new registrations
       in the "IGP Flex-Algorithm Path Computation Rules" registry:</t>
       
       <ol spacing="normal" type="1" indent="adaptive" start="1">
       <li derivedCounter="1.">
        <t>When a new constraint is defined, the rule associated with that constraint 
       MAY be inserted at any position. Backwards compatibility is guaranteed because 
       nodes which don't support the new constraint will not participate in an 
       algorithm where the FAD specifies a constraint they don't support.</t>
       </li>
       
       <li derivedCounter="2.">
           <t>The relative ordering of existing rules MUST NOT be altered. Doing so has 
           the potential to create backwards compatibility issues.</t>
       </li>
       
       <li derivedCounter="3.">
           <t>Deletion of the rules MUST NOT be done. Given that the rules are only used
      conditionally based on the information carried in the winning FAD, deletion of 
      the rule is not necessary.</t>
       </li>
       
       <li derivedCounter="4.">
           <t>Merging or repeating of the rules MUST NOT be done.</t>
       </li>
       
      </ol>
    
    </section>
  
    </section>

    <section anchor="Security" title="Security Considerations">
      <t>This document inherits security considerations from <xref
      target="RFC9350"/>.</t>
    </section>

    <section anchor="Acknowledgements" title="Acknowledgements">
      <t>TBD</t>
    </section>
  </middle>

  <back>
    <references title="Normative References">
      

      <?rfc include='reference.RFC.2119'?>

      <?rfc include='reference.RFC.8174'?>
      
      <?rfc include='reference.RFC.7308'?>
      
      <?rfc include='reference.RFC.9350'?>
      
      <?rfc include='reference.I-D.ietf-lsr-flex-algo-bw-con'?>

    </references>
  </back>
</rfc>
