Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-10
TEAS Working Group Italo Busi (Ed.)
Internet Draft Huawei
Intended status: Standard Track Sergio Belotti (Ed.)
Expires: January 2021 Nokia
Victor Lopez
Telefonica
Anurag Sharma
Google
Yan Shi
China Unicom
July 11, 2020
Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-10.txt
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), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet-
Drafts.
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."
The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html
This Internet-Draft will expire on January 11, 2021.
Busi, Belotti, al. Expires January 11, 2021 [Page 1]
Internet-Draft Yang for Path Computation July 2020
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
(http://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.
Abstract
There are scenarios, typically in a hierarchical SDN context, where
the topology information provided by a TE network provider may not
be sufficient for its client to perform end-to-end path computation.
In these cases the client would need to request the provider to
calculate some (partial) feasible paths.
This document defines a YANG data model for an RPC to request path
computation. This model complements the solution, defined in
RFCXXXX, to configure a TE Tunnel path in "compute-only" mode.
[RFC EDITOR NOTE: Please replace RFC XXXX with the RFC number of
draft-ietf-teas-yang-te once it has been published.
Moreover this document describes some use cases where a path
computation request, via YANG-based protocols (e.g., NETCONF or
RESTCONF), can be needed.
Table of Contents
1. Introduction...................................................3
1.1. Terminology...............................................5
1.2. Tree Diagram..............................................5
1.3. Prefixes in Data Node Names...............................5
2. Use Cases......................................................6
2.1. Packet/Optical Integration................................6
2.2. Multi-domain TE Networks.................................11
2.3. Data center interconnections.............................13
Busi, Belotti, et al. Expires January 11, 2021 [Page 2]
Internet-Draft Yang for Path Computation July 2020
2.4. Backward Recursive Path Computation scenario.............15
2.5. Hierarchical PCE scenario................................16
3. Motivations...................................................18
3.1. Motivation for a YANG Model..............................18
3.1.1. Benefits of common data models......................18
3.1.2. Benefits of a single interface......................19
3.1.3. Extensibility.......................................20
3.2. Interactions with TE Topology............................20
3.2.1. TE Topology Aggregation.............................21
3.2.2. TE Topology Abstraction.............................24
3.2.3. Complementary use of TE topology and path
computation.........................................25
Show full document text