Hierarchical Stateful Path Computation Element (PCE)
draft-ietf-pce-stateful-hpce-15
PCE Working Group D. Dhody
Internet-Draft Huawei Technologies
Intended status: Informational Y. Lee
Expires: April 23, 2020 SKKU
D. Ceccarelli
Ericsson
J. Shin
SK Telecom
D. King
Lancaster University
October 21, 2019
Hierarchical Stateful Path Computation Element (PCE)
draft-ietf-pce-stateful-hpce-15
Abstract
A Stateful Path Computation Element (PCE) maintains information on
the current network state received from the Path Computation Clients
(PCCs), including: computed Label Switched Path (LSPs), reserved
resources within the network, and pending path computation requests.
This information may then be considered when computing the path for a
new traffic-engineered LSP or for any associated/dependent LSPs. The
Path computation response from a PCE is helpful for the PCC to
gracefully establish the computed LSP.
The Hierarchical Path Computation Element (H-PCE) architecture
provides an architecture to allow the optimum sequence of
inter-connected domains to be selected, and network policy to be
applied if applicable, via the use of a hierarchical relationship
between PCEs.
Combining the capabilities of Stateful PCE and the Hierarchical PCE
would be advantageous. This document describes general considerations
and use cases for the deployment of Stateful, and not Stateless, PCEs
using the Hierarchical PCE architecture.
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
Dhody, et al. Expires April 2020 [Page 1]
Internet-Draft STATEFUL-HPCE October 2019
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 April 23, 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
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
1.1. Background . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2. Use cases and Applicability of Hierarchical Stateful PCE . 4
1.2.1. Applicability to ACTN . . . . . . . . . . . . . . . . 5
1.2.2. End-to-End Contiguous LSP . . . . . . . . . . . . . . 5
1.2.3. Applicability of a Stateful P-PCE . . . . . . . . . . 6
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.1. Requirement Language . . . . . . . . . . . . . . . . . . . 7
3. Hierarchical Stateful PCE . . . . . . . . . . . . . . . . . . 7
3.1. Passive Operations . . . . . . . . . . . . . . . . . . . . 9
3.2. Active Operations . . . . . . . . . . . . . . . . . . . . 11
3.3. PCE Initiation of LSPs . . . . . . . . . . . . . . . . . . 12
3.3.1. Per-Domain Stitched LSP . . . . . . . . . . . . . . . 13
4. Security Considerations . . . . . . . . . . . . . . . . . . . 15
5. Manageability Considerations . . . . . . . . . . . . . . . . . 16
5.1. Control of Function and Policy . . . . . . . . . . . . . . 16
5.2. Information and Data Models . . . . . . . . . . . . . . . 16
5.3. Liveness Detection and Monitoring . . . . . . . . . . . . 16
Show full document text