Skip to main content

Carrying SID Algorithm information in PCE-based Networks.
draft-ietf-pce-sid-algo-00

Document Type Expired Internet-Draft (pce WG)
Authors Alexej Tokar , Samuel Sidor , Shaofu Peng , Siva Sivabalan , Tarek Saad , Shuping Peng , Mahendra Singh Negi
Last updated 2022-08-26 (Latest revision 2022-02-22)
Replaces draft-tokar-pce-sid-algo
Stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Formats
Expired & archived
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)

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

Alexej Tokar
Samuel Sidor
Shaofu Peng
Siva Sivabalan
Tarek Saad
Shuping Peng
Mahendra Singh Negi

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