A New Internet-Draft is available from the on-line Internet-Drafts directories. This draft is a work item of the Link State Routing WG of the IETF.
Title : Algorithm Related IGP-Adjacency SID Advertisement Authors : Shaofu Peng Ran Chen Ketan Talaulikar Peter Psenak Filename : draft-ietf-lsr-algorithm-related-adjacency-sid-00.txt Pages : 13 Date : 2021-06-10 Abstract: 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 The IETF datatracker status page for this draft is: https://datatracker.ietf.org/doc/draft-ietf-lsr-algorithm-related-adjacency-sid/ There is also an htmlized version available at: https://datatracker.ietf.org/doc/html/draft-ietf-lsr-algorithm-related-adjacency-sid-00 Internet-Drafts are also available by anonymous FTP at: ftp://ftp.ietf.org/internet-drafts/ _______________________________________________ Lsr mailing list Lsr@ietf.org https://www.ietf.org/mailman/listinfo/lsr