metasystema.org
CurrentPROPOSED STANDARDIETF stream

RFC 9917: IGP Flexible Algorithms Reverse Affinity Constraint

In plain English — editorial summary, not part of the RFC

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.

Document record

Document ID
RFC9917
Published
January 2026
Authors
P. Psenak; J. Horn; A. Dhamija
Status
PROPOSED STANDARD
Stream
IETF
Area
rtg
Pages
12
Also known as
—
Updates:
RFC 9350, RFC 9843

Related documents

Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.

Also filed under

About this page

The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.

Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.

Data sources · Editorial policy · Report a correction · What is an RFC?

canonical URL: /rfc/9917-igp-flexible-algorithms-reverse-affinity-constraint