Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-08

The information below is for an old version of the document
Document Type Expired Internet-Draft (teas WG)
Authors Italo Busi  , Sergio Belotti  , Victor Lopez  , Anurag Sharma  , Yan Shi 
Last updated 2020-06-12 (latest revision 2019-12-10)
Replaces draft-busibel-teas-yang-path-computation
Stream Internet Engineering Task Force (IETF)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Reviews
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ietf-teas-yang-path-computation-08.txt

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.

Authors

Italo Busi (italo.busi@huawei.com)
Sergio Belotti (sergio.belotti@nokia.com)
Victor Lopez (victor.lopezalvarez@telefonica.com)
Anurag Sharma (ansha@google.com)
Yan Shi (shiyan49@chinaunicom.cn)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)