Movatterモバイル変換


[0]ホーム

URL:


Search RFCs

Advanced Search

RFC Editor

RFC 9350

IGP Flexible Algorithm,February 2023

File formats:

icon for HTMLicon for text fileicon for v3pdficon for XMLicon for inline errata
Also available:XML file for editing
 
Status:
PROPOSED STANDARD
Updated by:
RFC 9843,RFC 9917
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 listlsr@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 networkbased on the IGP metric assigned to the links. Many networkdeployments use RSVP-TE or Segment Routing - Traffic Engineering(SR-TE) to steer traffic over a path that is computed using differentmetrics or constraints than the shortest IGP path. This documentspecifies a solution that allows IGPs themselves to computeconstraint-based paths over the network. This document also specifiesa way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators tosteer packets along the constraint-based paths.


For the definition ofStatus,seeRFC 2026.

For the definition ofStream, seeRFC 8729.




IABIANAIETFIRTFISEISOCIETF Trust
ReportsPrivacy StatementSite MapContact Us

Advanced Search

[8]ページ先頭

©2009-2026 Movatter.jp