Border Gateway Protocol - Link State Extensions for Flexible Algorithm Advertisement
RFC 9351, “Border Gateway Protocol - Link State Extensions for Flexible Algorithm Advertisement”, is a Proposed Standard document published in February 2023 by K. Talaulikar, P. Psenak, S. Zandi, G. Dawra. The canonical text is published by the RFC Editor.
Abstract
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.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 9351 is hosted at rfc-editor.org. Available in HTML,TXT,PDF,XML.
- RFC 9350 IGP Flexible Algorithm
- RFC 9352 IS-IS Extensions to Support Segment Routing over the IPv6 Data Plane
- RFC 9349 Definitions of Managed Objects for IP Traffic Flow Security
- RFC 9353 IGP Extension for Path Computation Element Communication Protocol Security Capability Support in PCE Discovery
- RFC 9348 A YANG Data Model for IP Traffic Flow Security
- RFC 9354 Transmission of IPv6 Packets over Power Line Communication Networks
- RFC 9347 Aggregation and Fragmentation Mode for Encapsulating Security Payload and Its Use for IP Traffic Flow Security
- RFC 9355 OSPF Bidirectional Forwarding Detection Strict-Mode