{"draft":"draft-ietf-lsr-igp-flex-algo-reverse-affinity-12","doc_id":"RFC9917","title":"IGP Flexible Algorithms Reverse Affinity Constraint","authors":["P. Psenak","J. Horn","A. Dhamija"],"format":["HTML","TEXT","PDF","XML"],"page_count":"12","pub_status":"PROPOSED STANDARD","status":"PROPOSED STANDARD","source":"Link State Routing","abstract":"An IGP Flexible Algorithm (Flex-Algorithm) enables the computation of\r\nconstraint-based paths within an IGP domain, allowing operators to\r\ninfluence path selection according to administrative policies. This\r\ndocument defines an extension to Flex-Algorithm that allows the\r\ninclusion or exclusion of links from path computation based on\r\nAdministrative Groups (also known as link affinities) associated with\r\nthe reverse direction of the path under computation.\r\n\r\nThis document updates RFCs 9350 and 9843 by introducing the new IANA\r\nregistry that specifies the ordered set of rules that are used to\r\nprune links from the topology during the Flex-Algorithm path\r\ncomputation.","pub_date":"January 2026","keywords":[],"obsoletes":[],"obsoleted_by":[],"updates":["RFC9350","RFC9843"],"updated_by":[],"see_also":[],"doi":"10.17487\/RFC9917","errata_url":null}