PCEP Extensions for Segment Routing
draft-ietf-pce-segment-routing-11
| Document | Type | Expired Internet-Draft (pce WG) | |
|---|---|---|---|
| Authors | Siva Sivabalan , Clarence Filsfils , Jeff Tantsura , Wim Henderickx , Jonathan Hardwick | ||
| Last updated | 2018-05-24 (Latest revision 2017-11-20) | ||
| Replaces | draft-sivabalan-pce-segment-routing | ||
| Stream | Internet Engineering Task Force (IETF) | ||
| Formats |
Expired & archived
plain text
xml
htmlized
pdfized
bibtex
|
||
| Reviews | |||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-ietf-pce-segment-routing-11.txt
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 Routed 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 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 constraint(s) and optimization criteria in SR networks.
Authors
Siva Sivabalan
Clarence Filsfils
Jeff Tantsura
Wim Henderickx
Jonathan Hardwick
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)