Yang model for requesting Path Computation
draft-ietf-teas-yang-path-computation-08
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| 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 | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Reviews | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
Sergio Belotti
Victor Lopez
Anurag Sharma
Yan Shi
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)