IGP Flexible Algorithm Optimazition for Netwrok Slicing
draft-peng-lsr-flex-algo-opt-slicing-00

Document Type Active Internet-Draft (individual)
Last updated 2019-11-29
Stream (None)
Intended RFC status (None)
Formats plain text pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
L                                                              P. Shaofu
Internet-Draft                                                    C. Ran
Intended status: Standards Track                         ZTE Corporation
Expires: May 30, 2020                                          G. Mirsky
                                                               ZTE Corp.
                                                       November 27, 2019

        IGP Flexible Algorithm Optimazition for Netwrok Slicing
                draft-peng-lsr-flex-algo-opt-slicing-00

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 satisfy 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 May 30, 2020.

Copyright Notice

   Copyright (c) 2019 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 May 30, 2020                  [Page 1]
Internet-Draft             IGP FA Opt Slicing              November 2019

   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  . . . . . . . . . . . . .   4
   6.  AII of FAD Sub-TLV  . . . . . . . . . . . . . . . . . . . . .   5
     6.1.  ISIS AII of FAD Sub-TLV . . . . . . . . . . . . . . . . .   5
     6.2.  OSPF AII of FAD Sub-TLV . . . . . . . . . . . . . . . . .   6
   7.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   6
     7.1.  ISIS IANA Considerations  . . . . . . . . . . . . . . . .   6
     7.2.  OSPF IANA Considerations  . . . . . . . . . . . . . . . .   7
   8.  Security Considerations . . . . . . . . . . . . . . . . . . .   7
   9.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   7
   10. Normative References  . . . . . . . . . . . . . . . . . . . .   7
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   8

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-
   slice.

   This document extends the FAD of IGP Flex Algorithm to let IGPs
   compute constraint based paths limited in specific TN-slice.

Shaofu, et al.            Expires May 30, 2020                  [Page 2]
Internet-Draft             IGP FA Opt Slicing              November 2019
Show full document text