PCEP Extensions for Segment Routing
draft-sivabalan-pce-segment-routing-02
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Siva Sivabalan , Jan Medved , Clarence Filsfils , Edward Crabbe , Robert Raszuk | ||
| Last updated | 2014-04-19 (Latest revision 2013-10-16) | ||
| Replaced by | draft-ietf-pce-segment-routing, RFC 8664 | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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 instantiate Traffic Engineering paths, as well as a PCC to request a path subject to certain constraint(s) and optimization criteria in SR networks.
Authors
Siva Sivabalan
Jan Medved
Clarence Filsfils
Edward Crabbe
Robert Raszuk
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)