Flexible Algorithm Definition Advertisement with BGP Link-State
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|Ketan Talaulikar , Peter Psenak
|2019-01-02 (Latest revision 2018-07-01)
|draft-ietf-idr-bgp-ls-flex-algo, draft-ietf-idr-bgp-ls-flex-algo, RFC 9351
|Internet Engineering Task Force (IETF)
|Mailing list discussion
|Candidate for WG Adoption
|Send notices to
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Flexible Algorithm is a solution that allows routing protocols (viz. 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 distribute manner using a Flex Algorithm definition. This definition provisioned on one or more routers and propagated (viz. OSPF and IS- IS flooding) through the network. BGP Link-State (BGP-LS) enables the collection of various topology information from the network. This draft defines extensions to BGP- LS address-family to advertise the Flexible Algorithm Definition as a part of the topology information from the network.
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)