IGP Flexible Algorithm
RFC 9350, “IGP Flexible Algorithm”, is a Proposed Standard document published in February 2023 by P. Psenak, S. Hegde, C. Filsfils, K. Talaulikar, A. Gulko. It has since been updated by RFC 9843, RFC 9917. The canonical text is published by the RFC Editor.
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.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 9350 is hosted at rfc-editor.org. Available in HTML,TXT,PDF,XML.
- RFC 9349 Definitions of Managed Objects for IP Traffic Flow Security
- RFC 9351 Border Gateway Protocol - Link State Extensions for Flexible Algorithm Advertisement
- RFC 9348 A YANG Data Model for IP Traffic Flow Security
- RFC 9352 IS-IS Extensions to Support Segment Routing over the IPv6 Data Plane
- RFC 9347 Aggregation and Fragmentation Mode for Encapsulating Security Payload and Its Use for IP Traffic Flow Security
- RFC 9353 IGP Extension for Path Computation Element Communication Protocol Security Capability Support in PCE Discovery
- RFC 9346 IS-IS Extensions in Support of Inter-Autonomous System MPLS and GMPLS Traffic Engineering
- RFC 9354 Transmission of IPv6 Packets over Power Line Communication Networks