[Teas] I-D Action: draft-ietf-teas-yang-path-computation-02.txt
internet-drafts@ietf.org Fri, 29 June 2018 10:24 UTC
Return-Path: <internet-drafts@ietf.org>
X-Original-To: teas@ietf.org
Delivered-To: teas@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id CEBC0130DFA; Fri, 29 Jun 2018 03:24:07 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Cc: teas@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 6.81.3
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <153026784781.30412.10112885224719174640@ietfa.amsl.com>
Date: Fri, 29 Jun 2018 03:24:07 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/teas/Bd-fq8D_pwvm9p8IXRlvXrgQOmY>
Subject: [Teas] I-D Action: draft-ietf-teas-yang-path-computation-02.txt
X-BeenThere: teas@ietf.org
X-Mailman-Version: 2.1.26
List-Id: Traffic Engineering Architecture and Signaling working group discussion list <teas.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/teas>, <mailto:teas-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/teas/>
List-Post: <mailto:teas@ietf.org>
List-Help: <mailto:teas-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/teas>, <mailto:teas-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 29 Jun 2018 10:24:08 -0000
A New Internet-Draft is available from the on-line Internet-Drafts directories. This draft is a work item of the Traffic Engineering Architecture and Signaling WG of the IETF. Title : Yang model for requesting Path Computation Authors : Italo Busi Sergio Belotti Victor Lopez Oscar Gonzalez de Dios Anurag Sharma Yan Shi Ricard Vilalta Karthik Sethuraman Filename : draft-ietf-teas-yang-path-computation-02.txt Pages : 58 Date : 2018-06-29 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. The IETF datatracker status page for this draft is: https://datatracker.ietf.org/doc/draft-ietf-teas-yang-path-computation/ There are also htmlized versions available at: https://tools.ietf.org/html/draft-ietf-teas-yang-path-computation-02 https://datatracker.ietf.org/doc/html/draft-ietf-teas-yang-path-computation-02 A diff from the previous version is available at: https://www.ietf.org/rfcdiff?url2=draft-ietf-teas-yang-path-computation-02 Please note that it may take a couple of minutes from the time of submission until the htmlized version and diff are available at tools.ietf.org. Internet-Drafts are also available by anonymous FTP at: ftp://ftp.ietf.org/internet-drafts/
- [Teas] I-D Action: draft-ietf-teas-yang-path-comp… internet-drafts