Internet-Draft draft-ietf-lsr-algorithm-related-adjacency-sid-06.txt is now
available. It is a work item of the Link State Routing (LSR) WG of the IETF.
Title: Algorithm Related IGP-Adjacency SID Advertisement
Authors: Shaofu Peng
Ran Chen
Ketan Talaulikar
Peter Psenak
Name: draft-ietf-lsr-algorithm-related-adjacency-sid-06.txt
Pages: 16
Dates: 2023-12-05
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 Internet-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-06
A diff from the previous version is available at:
https://author-tools.ietf.org/iddiff?url2=draft-ietf-lsr-algorithm-related-adjacency-sid-06
Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts
_______________________________________________
Lsr mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/lsr
