IGP Flexible Algorithm Optimazition for Netwrok Slicing
draft-peng-lsr-flex-algo-opt-slicing-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Shaofu Peng , Ran Chen , Greg Mirsky | ||
| Last updated | 2021-03-09 (Latest revision 2020-09-05) | ||
| RFC stream | (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 Flex Algorithm proposes a solution that allows IGPs themselves to compute constraint based paths over the network, and it also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths. This document extends the use of the IGP Flex Algorithm to to be more suitable for network slicing scenarios.
Authors
Shaofu Peng
Ran Chen
Greg Mirsky
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)