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.
IETF · 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.
{
"id": "RFC9917",
"number": 9917,
"title_en": "IGP Flexible Algorithms Reverse Affinity Constraint",
"title_ru": "",
"summary_ru": "",
"purpose_ru": "",
"use_ru": "",
"full_translation_path": "",
"full_translation_checked_at": "",
"full_translation_source_sha256": "",
"architect_note_ru": "",
"topics_ru": [],
"translation_state": "not_prepared",
"verification_level": "not_prepared",
"verification_level_ru": "Русская выжимка не подготовлена",
"verification_note_ru": "",
"abstract_en": "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.",
"authors": [
"P. Psenak",
"J. Horn",
"A. Dhamija"
],
"organizations": [],
"publication_date": "2026-01-01",
"current_status": "PROPOSED STANDARD",
"current_status_ru": "Предлагаемый стандарт",
"publication_status": "PROPOSED STANDARD",
"publication_status_ru": "Предлагаемый стандарт",
"lifecycle": "active",
"lifecycle_ru": "Действующий",
"stream": "IETF",
"stream_ru": "IETF",
"area": "rtg",
"area_ru": "Маршрутизация",
"working_group": "lsr",
"source_draft": "draft-ietf-lsr-igp-flex-algo-reverse-affinity-12",
"page_count": 12,
"doi": "10.17487/RFC9917",
"keywords": [],
"formats": [
"HTML",
"TXT",
"PDF",
"XML"
],
"relations": {
"obsoletes": [],
"obsoleted_by": [],
"updates": [
"RFC9350",
"RFC9843"
],
"updated_by": [],
"is_also": [],
"see_also": []
},
"links": {
"info": "https://www.rfc-editor.org/info/rfc9917/",
"html": "https://www.rfc-editor.org/rfc/rfc9917.html",
"txt": "https://www.rfc-editor.org/rfc/rfc9917.txt",
"datatracker": "https://datatracker.ietf.org/doc/rfc9917/"
}
}