%% You should probably cite draft-ietf-teas-yang-path-computation-22 instead of this revision.
@techreport{ietf-teas-yang-path-computation-01,
    number =    {draft-ietf-teas-yang-path-computation-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-teas-yang-path-computation/01/},
    author =    {Italo Busi and Sergio Belotti and Victor Lopez and Oscar Gonzalez de Dios and Anurag Sharma and Yan Shi and Ricard Vilalta and Karthik Sethuraman and Michael Scharf and Daniele Ceccarelli},
    title =     {{Yang model for requesting Path Computation}},
    pagetotal = 53,
    year =      ,
    month =     ,
    day =       ,
    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.},
}