{
  "draft": "draft-ietf-idr-bgp-ls-flex-algo-12",
  "doc_id": "RFC9351",
  "title": "Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement",
  "authors": [
    "K. Talaulikar, Ed.",
    "P. Psenak",
    "S. Zandi",
    "G. Dawra"
  ],
  "format": [
    "XML",
    "TEXT",
    "HTML",
    "PDF"
  ],
  "page_count": "14",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Inter-Domain Routing",
  "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 (FAD). This definition is provisioned on one or more routers and propagated through the network by OSPF and IS-IS flooding.\n\n Border Gateway Protocol - 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 FAD as a part of the topology information from the network.",
  "pub_date": "February 2023",
  "keywords": [
    "BGP-LS",
    "Segment Routing",
    "IS-IS",
    "OSPF",
    "OSPFv3"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC9351",
  "errata_url": null
}