@techreport{ietf-lsr-algorithm-related-adjacency-sid-07, number = {draft-ietf-lsr-algorithm-related-adjacency-sid-07}, type = {Internet-Draft}, institution = {Internet Engineering Task Force}, publisher = {Internet Engineering Task Force}, note = {Work in Progress}, url = {https://datatracker.ietf.org/doc/draft-ietf-lsr-algorithm-related-adjacency-sid/07/}, author = {Ran Chen and Shaofu Peng and Ketan Talaulikar and Peter Psenak}, title = {{Algorithm Related IGP-Adjacency SID Advertisement}}, pagetotal = 16, year = 2024, month = jun, day = 12, abstract = {Segment Routing architecture supports the use of multiple routing algorithms, i.e., different constraint-based shortest-path calculations can be supported. Two standard algorithms are defined in the segment routing architecture: SPF and Strict-SPF. 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.}, }