PCE TE Constraints for Network Slicing
draft-peng-pce-te-constraints-04
PCE S. Peng
Internet-Draft Q. Xiong
Intended status: Standards Track ZTE Corporation
Expires: March 5, 2021 F. Qin
China Mobile
September 1, 2020
PCE TE Constraints for Network Slicing
draft-peng-pce-te-constraints-04
Abstract
This document proposes a set of extensions for PCEP to support the TE
constraints of network slicing during path computation, e.g, IGP
instance, virtual network, specific application, color template and
FA-id etc.
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 5, 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
include Simplified BSD License text as described in Section 4.e of
Peng, et al. Expires March 5, 2021 [Page 1]
Internet-Draft PCE TE Constraints for Network Slicing September 2020
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Conventions used in this document . . . . . . . . . . . . . . 3
2.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3
2.2. Requirements Language . . . . . . . . . . . . . . . . . . 3
3. PCEP Extensions for TE Constraints in Network Slicing . . . . 3
3.1. Source Protocol TLV . . . . . . . . . . . . . . . . . . . 3
3.2. Multi-topology TLV . . . . . . . . . . . . . . . . . . . 4
3.3. The AII TLV . . . . . . . . . . . . . . . . . . . . . . . 5
3.4. Application Specific TLV . . . . . . . . . . . . . . . . 6
3.5. The Color TLV . . . . . . . . . . . . . . . . . . . . . . 7
3.6. The FA-id TLV . . . . . . . . . . . . . . . . . . . . . . 8
4. Security Considerations . . . . . . . . . . . . . . . . . . . 9
5. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 10
6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10
7. Normative References . . . . . . . . . . . . . . . . . . . . 10
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12
1. Introduction
[RFC5440] describes the Path Computation Element Protocol (PCEP)
which is used between a Path Computation Element (PCE) and a Path
Computation Client (PCC) (or other PCE) to enable computation of
Multi-protocol Label Switching (MPLS) for Traffic Engineering Label
Switched Path (TE LSP). PCEP Extensions for the Stateful PCE Model
[RFC8231] describes a set of extensions to PCEP to enable active
control of MPLS-TE and Generalized MPLS (GMPLS) tunnels. As depicted
in [RFC4655], a PCE MUST be able to compute the path of a TE LSP by
operating on the TED and considering bandwidth and other constraints
applicable to the TE LSP service request. The constraint parameters
are provided such as metric, bandwidth, delay, affinity, etc.
However these parameters can't meet the network slicing requirements.
According to 5G context, network slicing is the collection of a set
of technologies to support network service differentiation and
meeting the diversified requirements from vertical industries. The
slices may be seen as virtual networks and partition the network
resources into sub-topologies in transport network. Multiple
existing identifiers could be used to identify the virtual network
resource and viewed as constraints of network slicing when PCE is
deployed.
A PCE always perform path computation based on the network topology
information collected through BGP-LS [RFC7752]. BGP-LS can get
Show full document text