IGP Flexible Algorithm with Deterministic Routing
draft-peng-lsr-flex-algo-deterministic-routing-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Shaofu Peng , Tony Li | ||
| Last updated | 2023-02-25 (Latest revision 2022-08-24) | ||
| RFC stream | (None) | ||
| Intended RFC status | (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
IGP Flexible Algorithm proposes a solution that allows IGPs to compute constraint based paths over the network and specifies a way of using Segment Routing (SR) Prefix-SIDs, SRv6 locators, or pure IP prefixes to steer packets along the constraint-based paths. This document describes how to compute deterministic delay paths within a Flex-Algorithm topology.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)