Algorithm Related IGP-Adjacency SID Advertisement
draft-peng-lsr-algorithm-related-adjacency-sid-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Shaofu Peng , Ran Chen | ||
| Last updated | 2020-09-10 (Latest revision 2020-03-09) | ||
| Replaced by | draft-ietf-lsr-algorithm-related-adjacency-sid | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| 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:
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 will complement that the algorithm identifier can be also included as part of a Adjacency-SID advertisement
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)