Carrying SID Algorithm information in PCE-based Networks.
Expired & archived
|Authors||Alexej Tokar , Samuel Sidor , Shaofu Peng , Siva Sivabalan , Tarek Saad , Shuping Peng , Mahendra Singh Negi|
|Last updated||2022-02-22 (Latest revision 2021-10-04)|
|RFC stream||Internet Engineering Task Force (IETF)|
|Intended RFC status||(None)|
|Stream||WG state||Adopted by a WG|
|IESG||IESG state||Replaced by draft-ietf-pce-sid-algo|
|Send notices to||(None)|
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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.
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)