Subject: [Teas] FW: New Version Notification for draft-ietf-teas-yang-path-computation-03.txt

From: Italo Busi <[email-masked]>
Date: Tue, 23 Oct 2018 12:16:46 +0000

Dear TEAS WG,

We have just uploaded a revised version of the I-D. The main changes are:

- new text based on the mailing list and offline discussions to clarify that the path being setup is not necessarily the same as the computed path and therefore that a path verification phase is needed to check that the actual path being setup meets the required end-to-end metrics and constraints (thanks to all who contributed to the mailing list discussion and to Dhruv for the suggestion about the path verification)
 
- YANG model updates to allow requesting the path srlgs and affinities being returned together with the result of path computation

We welcome further review and comments from the WG

Thanks, Sergio and Italo (on behalf of co-authors)

-----Original Message-----
From: [email-masked] [mailto:[email-masked]] 
Sent: Monday, October 22, 2018 6:01 PM
To: Ricard Vilata <[email-masked]>; Daniele Ceccarelli <[email-masked]>; Oscar Gonzalez de Dios <[email-masked]>; Michael Scharf <[email-masked]>; Oscar de Dios <[email-masked]>; Yan Shi <[email-masked]>; Ricard Vilalta <[email-masked]>; Sergio Belotti <[email-masked]>; Victor Lopezalvarez <[email-masked]>; Victor Lopez <[email-masked]>; Italo Busi <[email-masked]>; Anurag Sharma <[email-masked]>; Karthik Sethuraman <[email-masked]>
Subject: New Version Notification for draft-ietf-teas-yang-path-computation-03.txt

A new version of I-D, draft-ietf-teas-yang-path-computation-03.txt
has been successfully submitted by Italo Busi and posted to the
IETF repository.

Name:		draft-ietf-teas-yang-path-computation
Revision:	03
Title:		Yang model for requesting Path Computation
Document date:	2018-10-22
Group:		teas
Pages:		61
URL:            https://www.ietf.org/internet-drafts/draft-ietf-teas-yang-path-computation-03.txt
Status:         https://datatracker.ietf.org/doc/draft-ietf-teas-yang-path-computation/
Htmlized:       https://tools.ietf.org/html/draft-ietf-teas-yang-path-computation-03
Htmlized:       https://datatracker.ietf.org/doc/html/draft-ietf-teas-yang-path-computation
Diff:           https://www.ietf.org/rfcdiff?url2=draft-ietf-teas-yang-path-computation-03

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.

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.

The IETF Secretariat