<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.busibel-teas-yang-path-computation" target="https://datatracker.ietf.org/doc/html/draft-busibel-teas-yang-path-computation-03">
   <front>
      <title>Yang model for requesting Path Computation</title>
      <author initials="I." surname="Busi" fullname="Italo Busi">
         <organization>Huawei</organization>
      </author>
      <author initials="S." surname="Belotti" fullname="Sergio Belotti">
         <organization>Nokia</organization>
      </author>
      <author initials="V." surname="Lopez" fullname="Victor Lopez">
         <organization>Telefonica</organization>
      </author>
      <author initials="O. G." surname="de Dios" fullname="Oscar Gonzalez de Dios">
         <organization>Telefonica</organization>
      </author>
      <author initials="" surname="ansharma@infinera.com" fullname="ansharma@infinera.com">
         <organization>Infinera</organization>
      </author>
      <author initials="Y." surname="Shi" fullname="Yan Shi">
         <organization>China Unicom</organization>
      </author>
      <author initials="R." surname="Vilalta" fullname="Ricard Vilalta">
         <organization>CTTC</organization>
      </author>
      <author initials="K." surname="Sethuraman" fullname="Karthik Sethuraman">
         <organization>NEC</organization>
      </author>
      <author initials="M." surname="Scharf" fullname="Michael Scharf">
         <organization>Nokia</organization>
      </author>
      <author initials="D." surname="Ceccarelli" fullname="Daniele Ceccarelli">
         <organization>Ericsson</organization>
      </author>
      <date month="June" day="30" year="2017" />
      <abstract>
	 <t>   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].

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-busibel-teas-yang-path-computation-03" />
   
</reference>
