Skip to main content

Flexible Algorithm Definition Advertisement with BGP Link-State

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
Authors Ketan Talaulikar , Peter Psenak
Last updated 2019-01-02 (Latest revision 2018-07-01)
Replaced by draft-ietf-idr-bgp-ls-flex-algo, draft-ietf-idr-bgp-ls-flex-algo, RFC 9351
RFC stream Internet Engineering Task Force (IETF)
Additional resources Mailing list discussion
Stream WG state Candidate for WG Adoption
Document shepherd (None)
IESG IESG state Expired
Consensus boilerplate Unknown
Telechat date (None)
Responsible AD (None)
Send notices to (None)

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.


Ketan Talaulikar
Peter Psenak

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)