%% You should probably cite rfc9351 instead of this I-D.
@techreport{ietf-idr-bgp-ls-flex-algo-09,
    number =    {draft-ietf-idr-bgp-ls-flex-algo-09},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-idr-bgp-ls-flex-algo/09/},
    author =    {Ketan Talaulikar and Peter Psenak and Shawn Zandi and Gaurav Dawra},
    title =     {{Flexible Algorithm Definition Advertisement with BGP Link-State}},
    pagetotal = 15,
    year =      2022,
    month =     jul,
    day =       24,
    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 distributed manner using a Flexible Algorithm definition. This definition is 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 document defines extensions to the BGP-LS address family to advertise the Flexible Algorithm Definition as a part of the topology information from the network.},
}