IGP Extensions for Support of Slice Aggregate Aware Traffic Engineering
draft-bestbar-lsr-slice-aware-te-00
LSR Working Group W. Britto
Internet-Draft R. Shetty
Intended status: Standards Track C. Barth
Expires: August 26, 2021 Juniper Networks
B. Wen
Comcast
S. Peng
R. Chen
ZTE Corporation
February 22, 2021
IGP Extensions for Support of Slice Aggregate Aware Traffic Engineering
draft-bestbar-lsr-slice-aware-te-00
Abstract
A slice aggregate is a collection of packets that match a slice
policy selection criteria and are given the same forwarding
treatment. Slice Aggregate aware Traffic Engineering (SA-TE) is a
mechanism that facilitates Traffic Engineering (TE) path selection to
take into account the available network resources associated with a
specific slice aggregate. This document specifies the Interior
Gateway Protocol (IGP) extensions for support of SA-TE. This
includes the generalization of the semantics of a number of IGP
extensions already defined for existing MPLS Traffic Engineering in
[RFC3630], [RFC4124], [RFC5305] and additional IGP extensions beyond
those.
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 August 26, 2021.
Britto, et al. Expires August 26, 2021 [Page 1]
Internet-Draft IGP Slice Aware TE February 2021
Copyright Notice
Copyright (c) 2021 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
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Requirements Language . . . . . . . . . . . . . . . . . . . . 4
3. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4
4. Resource Allocation . . . . . . . . . . . . . . . . . . . . . 4
4.1. Resource Sharing and Resource Overbooking . . . . . . . . 5
4.2. SA-TE Resource Allocation Model . . . . . . . . . . . . . 5
5. Next-hop Filtering Capability . . . . . . . . . . . . . . . . 5
6. IS-IS Extensions for SA-TE . . . . . . . . . . . . . . . . . 7
6.1. Network Slicing GENINFO TLV . . . . . . . . . . . . . . . 7
6.2. Slice Aggregate Aware Traffic Engineering Capabilities
APPsub-TLV . . . . . . . . . . . . . . . . . . . . . . . 7
6.3. Slice Aggregate Aware Traffic Engineering Link APPsub-TLV 8
6.4. Slice Aggregate Aware Traffic Engineering Link Attributes
Sub-sub-TLV . . . . . . . . . . . . . . . . . . . . . . . 10
6.4.1. Slice Aggregate Aware Traffic Engineering Unreserved
Bandwidth Sub-sub-sub-TLV . . . . . . . . . . . . . . 10
6.4.2. Slice Aggregate Aware Traffic Engineering Residual
Bandwidth Sub-sub-sub-TLV . . . . . . . . . . . . . . 11
6.4.3. Slice Aggregate Aware Traffic Engineering Available
Bandwidth Sub-sub-sub-TLV . . . . . . . . . . . . . . 11
6.4.4. Slice Aggregate Aware Traffic Engineering Utilized
Bandwidth Sub-sub-sub-TLV . . . . . . . . . . . . . . 12
7. OSPF Extensions for SA-TE . . . . . . . . . . . . . . . . . . 12
8. Functional Example of Unreserved-Bandwidth Advertisements . . 12
8.1. Formula to Compute the Unreserved Bandwidth . . . . . . . 12
8.2. Examples . . . . . . . . . . . . . . . . . . . . . . . . 13
Show full document text