Skip to main content

Algorithm Related IGP-Adjacency SID Advertisement

Document Type Replaced Internet-Draft (lsr WG)
Expired & archived
Authors Shaofu Peng , Ran Chen , Ketan Talaulikar , Peter Psenak
Last updated 2021-06-10 (Latest revision 2021-05-17)
Replaced by draft-ietf-lsr-algorithm-related-adjacency-sid
RFC stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Additional resources Mailing list discussion
Stream WG state Adopted by a WG
Document shepherd (None)
IESG IESG state Replaced by draft-ietf-lsr-algorithm-related-adjacency-sid
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:


Segment Routing architecture supports the use of multiple routing algorithms, i.e, different constraint-based shortest-path calculations can be supported. There are two standard algorithms: SPF and Strict-SPF, defined in Segment Routing architecture. There are also other user defined algorithms according to Flex-algo applicaiton. However, an algorithm identifier is often included as part of a Prefix-SID advertisement, that maybe not satisfy some scenarios where multiple algorithm share the same link resource. This document complement that the algorithm identifier can be also included as part of a Adjacency-SID advertisement


Shaofu Peng
Ran Chen
Ketan Talaulikar
Peter Psenak

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