{"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":["HTML","TEXT","PDF","XML"],"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\r\nwithout relying on a hop-by-hop signaling technique (e.g., LDP or\r\nRSVP-TE). It depends only on \"segments\" that are advertised by\r\nlink-state Interior Gateway Protocols (IGPs). An SR path can be\r\nderived from a variety of mechanisms, including an IGP Shortest Path\r\nTree (SPT), an explicit configuration, or a Path Computation Element\r\n(PCE). This document specifies extensions to the Path Computation\r\nElement Communication Protocol (PCEP) that allow a stateful PCE to\r\ncompute and initiate Traffic-Engineering (TE) paths, as well as a\r\nPath Computation Client (PCC) to request a path subject to certain\r\nconstraints and optimization criteria in SR networks.\r\n\r\nThis document updates RFC 8408.","pub_date":"December 2019","keywords":["SR","Traffic-Engineering","PCE"],"obsoletes":[],"obsoleted_by":[],"updates":["RFC8408"],"updated_by":["RFC9756"],"see_also":[],"doi":"10.17487\/RFC8664","errata_url":"https:\/\/www.rfc-editor.org\/errata\/rfc8664"}