File formats:

Also available: XML file for editing

 

Status:

PROPOSED STANDARD

Authors:

K. Talaulikar, Ed.
P. Psenak
S. Zandi
G. Dawra

Stream:

IETF

Source:

idr (rtg)

Cite this RFC: TXT  |  XML  |   BibTeX

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

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

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

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.

For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 8729.