[Teas] I-D Action: draft-ietf-teas-yang-path-computation-00.txt
internet-drafts@ietf.org Mon, 13 November 2017 06:33 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 38AD9124B18; Sun, 12 Nov 2017 22:33:00 -0800 (PST)
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.65.1
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <151055478013.21350.18407153229818243347@ietfa.amsl.com>
Date: Sun, 12 Nov 2017 22:33:00 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/teas/5vhXj59jF3Hl1hNrE9THr0wBNuM>
Subject: [Teas] I-D Action: draft-ietf-teas-yang-path-computation-00.txt
X-BeenThere: teas@ietf.org
X-Mailman-Version: 2.1.22
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: Mon, 13 Nov 2017 06:33:00 -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 Michael Scharf Daniele Ceccarelli Filename : draft-ietf-teas-yang-path-computation-00.txt Pages : 44 Date : 2017-11-12 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). This document describes some use cases where a path computation request, via YANG-based protocols (e.g., NETCONF or RESTCONF), can be needed. This document also proposes a yang model for a stateless RPC which complements the stateful solution defined in [TE-TUNNEL]. 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-00 https://datatracker.ietf.org/doc/html/draft-ietf-teas-yang-path-computation-00 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