RFC 9917

IGP Flexible Algorithms Reverse Affinity Constraint, January 2026

File formats:

icon for HTML icon for text file icon for v3pdf icon for XML
Also available: XML file for editing
 
Status:
PROPOSED STANDARD
Updates:
RFC 9350, RFC 9843
Authors:
P. Psenak
J. Horn
A. Dhamija
Stream:
IETF
Source:
lsr (rtg)

Cite this RFC: TXT  |  XML  |   BibTeX

DOI:  https://doi.org/10.17487/RFC9917

Discuss this RFC: Send questions or comments to the mailing list lsr@ietf.org

Other actions: Submit Errata  |  Find IPR Disclosures from the IETF  |  View History of RFC 9917


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 document updates RFCs 9350 and 9843 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.


For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 8729.




Advanced Search