{
  "draft": "draft-ietf-pce-segment-routing-16",
  "doc_id": "RFC8664",
  "title": "Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing",
  "authors": [
    "S. Sivabalan",
    "C. Filsfils",
    "J. Tantsura",
    "W. Henderickx",
    "J. Hardwick"
  ],
  "format": [
    "XML",
    "TEXT",
    "HTML",
    "PDF"
  ],
  "page_count": "29",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Path Computation Element",
  "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.\n\n This document updates RFC 8408.",
  "pub_date": "December 2019",
  "keywords": [
    "SR",
    "Traffic-Engineering",
    "PCE"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [
    "RFC8408"
  ],
  "updated_by": [
    "RFC9756",
    "RFC9933"
  ],
  "see_also": [],
  "doi": "10.17487/RFC8664",
  "errata_url": "https://www.rfc-editor.org/errata/rfc8664"
}