RFC9351 · Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement
Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement
Flexible Algorithm is a solution that allows some routing protocols (e.g., OSPF and IS-IS) to compute paths over a network based on user-defined (and hence, flexible) constraints and metrics. The computation is performed by routers participating in the specific network in a distributed manner using a Flexible Algorithm Definition (FAD). This definition is provisioned on one or more routers and propagated through the network by OSPF and IS-IS flooding. Border Gateway Protocol - Link State (BGP-LS) enables the collection of various topology information from the network. This document defines extensions to the BGP-LS address family to advertise the FAD as a part of the topology information from the network.
IETF · RFCОфициальная английская аннотация
Flexible Algorithm is a solution that allows some routing protocols (e.g., OSPF and IS-IS) to compute paths over a network based on user-defined (and hence, flexible) constraints and metrics. The computation is performed by routers participating in the specific network in a distributed manner using a Flexible Algorithm Definition (FAD). This definition is provisioned on one or more routers and propagated through the network by OSPF and IS-IS flooding. Border Gateway Protocol - Link State (BGP-LS) enables the collection of various topology information from the network. This document defines extensions to the BGP-LS address family to advertise the FAD as a part of the topology information from the network.
{
"id": "RFC9351",
"number": 9351,
"title_en": "Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement",
"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": "Flexible Algorithm is a solution that allows some routing protocols (e.g., OSPF and IS-IS) to compute paths over a network based on user-defined (and hence, flexible) constraints and metrics. The computation is performed by routers participating in the specific network in a distributed manner using a Flexible Algorithm Definition (FAD). This definition is provisioned on one or more routers and propagated through the network by OSPF and IS-IS flooding. Border Gateway Protocol - Link State (BGP-LS) enables the collection of various topology information from the network. This document defines extensions to the BGP-LS address family to advertise the FAD as a part of the topology information from the network.",
"authors": [
"K. Talaulikar",
"P. Psenak",
"S. Zandi",
"G. Dawra"
],
"organizations": [],
"publication_date": "2023-02-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": "idr",
"source_draft": "draft-ietf-idr-bgp-ls-flex-algo-12",
"page_count": 14,
"doi": "10.17487/RFC9351",
"keywords": [
"BGP-LS",
"Segment Routing",
"IS-IS",
"OSPF",
"OSPFv3"
],
"formats": [
"HTML",
"TXT",
"PDF",
"XML"
],
"relations": {
"obsoletes": [],
"obsoleted_by": [],
"updates": [],
"updated_by": [],
"is_also": [],
"see_also": []
},
"links": {
"info": "https://www.rfc-editor.org/info/rfc9351/",
"html": "https://www.rfc-editor.org/rfc/rfc9351.html",
"txt": "https://www.rfc-editor.org/rfc/rfc9351.txt",
"datatracker": "https://datatracker.ietf.org/doc/rfc9351/"
}
}