Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-06

Document Type Active Internet-Draft (teas WG)
Last updated 2019-07-08
Replaces draft-busibel-teas-yang-path-computation
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Yang Validation 0 errors, 3 warnings.
Additional URLs
- Yang catalog entry for ietf-te-path-computation@2019-03-11.yang
- Yang impact analysis for draft-ietf-teas-yang-path-computation
- Mailing list discussion
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
TEAS Working Group                                     Italo Busi (Ed.)
Internet Draft                                                   Huawei
Intended status: Standard Track                    Sergio Belotti (Ed.)
Expires: January 2020                                             Nokia

                                                           July 8, 2019

                Yang model for requesting Path Computation
               draft-ietf-teas-yang-path-computation-06.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 8, 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
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document. Please review these documents

Busi, Belotti, al.     Expires January 8, 2020                 [Page 1]
Internet-Draft        Yang for Path Computation               July 2019

   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
      2.4. Backward Recursive Path Computation scenario.............14
      2.5. Hierarchical PCE scenario................................15
   3. Motivations...................................................17
      3.1. Motivation for a YANG Model..............................17
         3.1.1. Benefits of common data models......................17
         3.1.2. Benefits of a single interface......................18
         3.1.3. Extensibility.......................................19
      3.2. Interactions with TE Topology............................19
         3.2.1. TE Topology Aggregation.............................20
         3.2.2. TE Topology Abstraction.............................23
         3.2.3. Complementary use of TE topology and path computation24
      3.3. Stateless and Stateful Path Computation..................27
         3.3.1. Temporary reporting of the computed path state......29
   4. Path Computation and Optimization for multiple paths..........31

Busi, Belotti, et al.  Expires January 8, 2020                 [Page 2]
Internet-Draft        Yang for Path Computation               July 2019

   5. YANG Model for requesting Path Computation....................32
      5.1. Synchronization of multiple path computation requests....32
      5.2. Returned metric values...................................34
   6. YANG model for stateless TE path computation..................36
      6.1. YANG Tree................................................36
      6.2. YANG Module..............................................46
   7. Security Considerations.......................................61
   8. IANA Considerations...........................................62
Show full document text