@misc{rfc8664,
    series =    {Request for Comments},
    number =    8664,
    howpublished =  {RFC 8664},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC8664},
    url =       {https://www.rfc-editor.org/info/rfc8664},
    author =    {Siva Sivabalan and Clarence Filsfils and Jeff Tantsura and Wim Henderickx and Jonathan Hardwick},
    title =     {{Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing}},
    pagetotal = 29,
    year =      2019,
    month =     dec,
    abstract =  {Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by link-state Interior Gateway Protocols (IGPs). An SR path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), an explicit configuration, or a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Communication Protocol (PCEP) that allow a stateful PCE to compute and initiate Traffic-Engineering (TE) paths, as well as a Path Computation Client (PCC) to request a path subject to certain constraints and optimization criteria in SR networks. This document updates RFC 8408.},
}