Carrying SID Algorithm information in PCE-based Networks.
draft-tokar-pce-sid-algo-01
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Alex Tokar , Siva Sivabalan , Mahendra Singh Negi | ||
| Last updated | 2020-07-03 (Latest revision 2019-12-31) | ||
| Replaced by | draft-ietf-pce-sid-algo, draft-ietf-pce-sid-algo, draft-ietf-pce-sid-algo | ||
| RFC stream | (None) | ||
| Formats | |||
| Additional resources | |||
| 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
The Algorithm associated with a prefix Segment-ID (SID) defines the path computation Algorithm used by Interior Gateway Protocols (IGPs). This information is available to controllers such as the Path Computation Element (PCE) via topology learning. This document proposes an approach for informing headend routers regarding the Algorithm associated with each prefix SID used in PCE-computed paths, as well as signalling a specific SID algorithm as a constraint to the PCE.
Authors
Alex Tokar
Siva Sivabalan
Mahendra Singh Negi
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)