Skip to main content

Advertising Flexible Algorithm Extensions in BGP Link-State
draft-hegdearavind-idr-bgp-ls-flex-algo-ext-02

Document Type Replaced Internet-Draft (candidate for idr WG)
Expired & archived
Authors Shraddha Hegde , Aravind Babu MahendraBabu , Ketan Talaulikar , Peter Psenak , Bruno Decraene
Last updated 2025-10-17 (Latest revision 2025-10-09)
Replaces draft-aravindbabu-idr-bgp-ls-flex-algo-ext, draft-hegde-idr-bgpls-ip-flex-algo-bw-con
Replaced by draft-ietf-idr-bgp-ls-flex-algo-ext
RFC stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Formats
Additional resources Mailing list discussion
Stream WG state Call For Adoption By WG Issued
Document shepherd (None)
IESG IESG state Replaced by draft-ietf-idr-bgp-ls-flex-algo-ext
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:

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. This Definition is provisioned on one or more routers and propagated through the network by OSPF and IS-IS flooding. BGP Link-State (BGP-LS) enables the collection of various topology information from the network. BGP-LS supports the advertisement of Flexible Algorithm Definition and other Flexible Algorithm related advertisements as a part of the topology information from the network. This document specifies the advertisement of further Flexible Algorithm related extensions in BGP-LS.

Authors

Shraddha Hegde
Aravind Babu MahendraBabu
Ketan Talaulikar
Peter Psenak
Bruno Decraene

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