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

Document Type Active Internet-Draft (teas WG)
Last updated 2018-03-05
Replaces draft-busibel-teas-yang-path-computation
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Yang Validation 3 errors, 0 warnings.
Additional URLs
- Yang catalog entry for ietf-te-path-computation@2018-03-02.yang
- Yang impact analysis for draft-ietf-teas-yang-path-computation
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: September 2018                                           Nokia
                                                           Victor Lopez
                                                 Oscar Gonzalez de Dios
                                                             Telefonica
                                                          Anurag Sharma
                                                                 Google
                                                                Yan Shi
                                                           China Unicom
                                                         Ricard Vilalta
                                                                   CTTC
                                                     Karthik Sethuraman
                                                                    NEC

                                                          March 5, 2018

               Yang model for requesting Path Computation
              draft-ietf-teas-yang-path-computation-01.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

Busi, Belotti, al.    Expires September 5, 2018                [Page 1]
Internet-DraftYang model for requesting Path Computation     March 2018

   The list of Internet-Draft Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html

   This Internet-Draft will expire on September 5, 2016.

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, in
   which an orchestrator may not have detailed information to be able
   to perform an end-to-end path computation and would need to request
   lower layer/domain controllers to calculate some (partial) feasible
   paths.

   Multiple protocol solutions can be used for communication between
   different controller hierarchical levels. This document assumes that
   the controllers are communicating using YANG-based protocols (e.g.,
   NETCONF or RESTCONF).

   Based on this assumption this document proposes a YANG model for a
   path computation request that an higher controller can exploit to
   retrieve the needed information, complementing his topology
   knowledge, to make his E2E path computation feasible.

   The draft proposes a stateless RPC which 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.

Busi, Belotti, et al. Expires September 5, 2018                [Page 2]
Internet-DraftYang model for requesting Path Computation     March 2018

Table of Contents

   1. Introduction...................................................3
      1.1. Terminology...............................................5
   2. Use Cases......................................................5
      2.1. Packet/Optical Integration................................5
      2.2. Multi-domain TE Networks..................................8
      2.3. Data center interconnections.............................10
   3. Motivations...................................................12
      3.1. Motivation for a YANG Model..............................12
         3.1.1. Benefits of common data models......................12
         3.1.2. Benefits of a single interface......................12
         3.1.3. Extensibility.......................................13
Show full document text