IGP Flexible Algorithm Optimazition for Netwrok Slicing
draft-peng-lsr-flex-algo-opt-slicing-02
L P. Shaofu
Internet-Draft C. Ran
Intended status: Standards Track ZTE Corporation
Expires: March 9, 2021 G. Mirsky
ZTE Corp.
September 5, 2020
IGP Flexible Algorithm Optimazition for Netwrok Slicing
draft-peng-lsr-flex-algo-opt-slicing-02
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.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on March 9, 2021.
Copyright Notice
Copyright (c) 2020 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
Shaofu, et al. Expires March 9, 2021 [Page 1]
Internet-Draft IGP FA Opt Slicing September 2020
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Requirements Language . . . . . . . . . . . . . . . . . . . . 3
3. SR Policy Using Slice-based Resources . . . . . . . . . . . . 3
4. SR Policy Optimaztion with IGP Flex-algo . . . . . . . . . . 3
5. IGP Flex-algo Enhancement with AII . . . . . . . . . . . . . 5
5.1. Enhancement for TI-LFA . . . . . . . . . . . . . . . . . 5
5.2. Enhancement for Inter-domain . . . . . . . . . . . . . . 5
5.3. Enhancement for L2bundles . . . . . . . . . . . . . . . . 6
6. QoS Policy per AII/Algorithm . . . . . . . . . . . . . . . . 6
7. AII of FAD Sub-TLV . . . . . . . . . . . . . . . . . . . . . 7
7.1. ISIS AII of FAD Sub-TLV . . . . . . . . . . . . . . . . . 7
7.2. OSPF AII of FAD Sub-TLV . . . . . . . . . . . . . . . . . 8
8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8
8.1. ISIS IANA Considerations . . . . . . . . . . . . . . . . 8
8.2. OSPF IANA Considerations . . . . . . . . . . . . . . . . 9
9. Security Considerations . . . . . . . . . . . . . . . . . . . 9
10. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 9
11. Normative References . . . . . . . . . . . . . . . . . . . . 9
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 10
1. Introduction
IGP Flex Algorithm [I-D.ietf-lsr-flex-algo] 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. It specifies a set of extensions to ISIS, OSPFv2 and
OSPFv3 that enable a router to send TLVs that identify (a)
calculation-type, (b) specify a metric-type, and (c )describe a set
of constraints on the topology, that are to be used to compute the
best paths along the constrained topology. A given combination of
calculation-type, metric-type, and constraints is known as an FAD
(Flexible Algorithm Definition).
[I-D.peng-teas-network-slicing] proposes a solution to extend the
control plane of transport network to instantiate the Network Slice
Instance (NSI) in transport network. A new identifier, AII, instead
of existing TE affinity or other identifiers, is introduced to
represent a TN-slice and specify the dedicated resource for the TN-
Show full document text