TEAS Working Group Italo Busi (Ed.)
Internet Draft Huawei
Intended status: Standard Track Sergio Belotti (Ed.)
Expires: May 2019 Nokia
Victor Lopez
Oscar Gonzalez de Dios
Telefonica
Anurag Sharma
Google
Yan Shi
China Unicom
Ricard Vilalta
CTTC
Karthik Sethuraman
NEC
November 4, 2018
Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-04.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
Busi, Belotti, al. Expires May 4, 2019 [Page 1]Internet-Draft Yang for Path Computation November 2018
This Internet-Draft will expire on May 4, 2019.
Copyright Notice
Copyright (c) 2018 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 a stateless RPC to
request path computation. This model complements the stateful
solution defined in [TE-TUNNEL].
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...............................................4
2. Use Cases......................................................5
2.1. Packet/Optical Integration................................5
2.2. Multi-domain TE Networks.................................10
2.3. Data center interconnections.............................12
3. Motivations...................................................14
3.1. Motivation for a YANG Model..............................14
3.1.1. Benefits of common data models......................14
Busi, Belotti, et al. Expires May 4, 2019 [Page 2]Internet-Draft Yang for Path Computation November 2018
3.1.2. Benefits of a single interface......................15
3.1.3. Extensibility.......................................15
3.2. Interactions with TE Topology............................16
3.2.1. TE Topology Aggregation.............................17
3.2.2. TE Topology Abstraction.............................20
3.2.3. Complementary use of TE topology and path computation21