IGP Flexible Algorithm Optimazition for Netwrok Slicing

Document Type Expired Internet-Draft (individual)
Authors Shaofu Peng  , Ran Chen  , Greg Mirsky 
Last updated 2021-03-09 (latest revision 2020-09-05)
Stream (None)
Intended RFC status (None)
Expired & archived
plain text htmlized pdfized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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.


Shaofu Peng (peng.shaofu@zte.com.cn)
Ran Chen (chen.ran@zte.com.cn)
Greg Mirsky (gregimirsky@gmail.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)