RFC 9350
IGP Flexible Algorithm, February 2023
- File formats:
- Also available: XML file for editing
- Status:
- PROPOSED STANDARD
- Authors:
- P. Psenak, Ed.
S. Hegde
C. Filsfils
K. Talaulikar
A. Gulko - Stream:
- IETF
- Source:
- lsr (rtg)
Cite this RFC: TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC9350
Discuss this RFC: Send questions or comments to the mailing list lsr@ietf.org
Other actions: View Errata | Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 9350
Abstract
IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.