(Created page with " == 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...") |
m (Scipediacontent moved page Draft Content 551758450 to Henderickx et al 2019a) |
(No difference)
| |
Latest revision as of 14:14, 11 February 2021
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:
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
Share this document
claim authorship
Are you one of the authors of this document?