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). A Segment Routing Path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), 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 PCC to request a path subject to certain constraints and optimization criteria in SR networks.


Original document

The different versions of the original document can be found in:

https://www.rfc-editor.org/info/rfc8664,
https://www.rfc-editor.org/rfc/rfc8664.txt,
https://trac.tools.ietf.org/html/rfc8664,
https://academic.microsoft.com/#/detail/2994118834
Back to Top

Document information

Published on 05/12/19
Accepted on 05/12/19
Submitted on 05/12/19

Volume 2019, 2019
DOI: 10.17487/rfc8664
Licence: CC BY-NC-SA license

Document Score

0

Views 3
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?