UpdatedPROPOSED STANDARDIETF stream

RFC 9350: IGP Flexible Algorithm

Still current, but amended. Parts of this document are changed or extended by RFC 9843, RFC 9917. Read both.

In plain English — editorial summary, not part of the RFC

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.

Document record

Document ID
RFC9350
Published
February 2023
Authors
P. Psenak; S. Hegde; C. Filsfils; K. Talaulikar; A. Gulko
Status
PROPOSED STANDARD
Stream
IETF
Area
rtg
Pages
42
Also known as
Updated by:
RFC 9843, RFC 9917

Referenced by

2 later RFCs formally update or obsolete part of this document.

Related documents

Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.

Also filed under

About this page

The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.

Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.

Data sources · Editorial policy · Report a correction · What is an RFC?

canonical URL: /rfc/9350-igp-flexible-algorithm