Carrying SID Algorithm information in PCE-based Networks.
draft-tokar-pce-sid-algo-01

Document Type Expired Internet-Draft (individual)
Last updated 2020-07-03 (latest revision 2019-12-31)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-tokar-pce-sid-algo-01.txt

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

Alexej Tokar (atokar@cisco.com)
Siva Sivabalan (msiva@cisco.com)
Mahendra Negi (mahendrasingh@huawei.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)