{
  "draft": "draft-ietf-lsr-flex-algo-26",
  "doc_id": "RFC9350",
  "title": "IGP Flexible Algorithm",
  "authors": [
    "P. Psenak, Ed.",
    "S. Hegde",
    "C. Filsfils",
    "K. Talaulikar",
    "A. Gulko"
  ],
  "format": [
    "XML",
    "TEXT",
    "HTML",
    "PDF"
  ],
  "page_count": "42",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Link State Routing",
  "abstract": "IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links.  Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path.  This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network.  This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.",
  "pub_date": "February 2023",
  "keywords": [],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [
    "RFC9843",
    "RFC9917"
  ],
  "see_also": [],
  "doi": "10.17487/RFC9350",
  "errata_url": "https://www.rfc-editor.org/errata/rfc9350"
}