@misc{rfc9350,
    series =    {Request for Comments},
    number =    9350,
    howpublished =  {RFC 9350},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC9350},
    url =       {https://www.rfc-editor.org/info/rfc9350},
    author =    {Peter Psenak and Shraddha Hegde and Clarence Filsfils and Ketan Talaulikar and Arkadiy Gulko},
    title =     {{IGP Flexible Algorithm}},
    pagetotal = 42,
    year =      2023,
    month =     feb,
    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.},
}