Flexible Algorithm Definition Advertisement with BGP Link-State
draft-ketant-idr-bgp-ls-flex-algo-01
| Document | Type | Replaced Internet-Draft (idr WG) | |
|---|---|---|---|
| Last updated | 2019-05-29 (latest revision 2019-02-22) | ||
| Replaced by | draft-ietf-idr-bgp-ls-flex-algo | ||
| Stream | IETF | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | WG state | Adopted by a WG | |
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Replaced by draft-ietf-idr-bgp-ls-flex-algo | |
| Consensus Boilerplate | Unknown | ||
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-ketant-idr-bgp-ls-flex-algo-01.txt
Abstract
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.
Authors
Ketan Talaulikar
(ketant@cisco.com)
Peter Psenak
(ppsenak@cisco.com)
Shawn Zandi
(szandi@linkedin.com)
Gaurav Dawra
(gdawra.ietf@gmail.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)