%% You should probably cite draft-ietf-lsr-algorithm-related-adjacency-sid-06 instead of this revision.
@techreport{ietf-lsr-algorithm-related-adjacency-sid-01,
    number =    {draft-ietf-lsr-algorithm-related-adjacency-sid-01},
    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/01/},
    author =    {Shaofu Peng and Ran Chen and Ketan Talaulikar and Peter Psenak},
    title =     {{Algorithm Related IGP-Adjacency SID Advertisement}},
    pagetotal = 15,
    year =      2021,
    month =     oct,
    day =       9,
    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},
}