{
  "number": 9351,
  "title": "Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement",
  "authors": [
    "K. Talaulikar, Ed.",
    "P. Psenak",
    "S. Zandi",
    "G. Dawra"
  ],
  "published": "2023-02",
  "status": "Proposed Standard",
  "stream": "IETF",
  "area": "rtg",
  "working_group": "idr",
  "pages": 14,
  "formats": [
    "HTML",
    "TXT",
    "PDF",
    "XML"
  ],
  "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\nBorder 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.",
  "keywords": [
    "BGP-LS",
    "Segment Routing",
    "IS-IS",
    "OSPF",
    "OSPFv3"
  ],
  "draft": "draft-ietf-idr-bgp-ls-flex-algo-12",
  "doi": "10.17487/RFC9351",
  "urls": {
    "html": "https://rfc.dk/rfc9351/",
    "text": "https://rfc.dk/rfc9351.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc9351",
    "datatracker": "https://datatracker.ietf.org/doc/rfc9351/"
  },
  "text_modified": "2023-02-22T19:12:55.243762854Z"
}