@techreport{ietf-lsr-igp-flex-algo-reverse-affinity-12,
    number =    {draft-ietf-lsr-igp-flex-algo-reverse-affinity-12},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://backiee.wasmer.app/https_datatracker_ietf_org/doc/draft-ietf-lsr-igp-flex-algo-reverse-affinity/12/},
    author =    {Peter Psenak and Jakub Horn and Amit Dhamija},
    title =     {{IGP Flexible Algorithms Reverse Affinity Constraint}},
    pagetotal = 16,
    year =      2025,
    month =     aug,
    day =       5,
    abstract =  {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. 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. This document updates {[}RFC9350{]} and {[}I-D.ietf-lsr-flex-algo-bw-con{]} by introducing the new IANA registry that specifies the ordered set of rules that are used to prune links from the topology during the Flex-Algorithm path computation.},
}