Path Computation API
draft-busibel-ccamp-path-computation-api-00

Document Type Replaced Internet-Draft (individual)
Last updated 2016-07-08
Replaced by draft-busibel-teas-yang-path-computation
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-busibel-teas-yang-path-computation
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-busibel-ccamp-path-computation-api-00.txt

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 Application Programming Interface (APIs). This document describes some use cases for an Application Programming Interface for path computation. A related yang model will be proposed in a next version or in another document.

Authors

Italo Busi (italo.busi@huawei.com)
Sergio Belotti (sergio.belotti@nokia.com)
Victor Lopezalvarez (victor.lopezalvarez@telefonica.com)
Oscar de Dios (oscar.gonzalezdedios@telefonica.com)
ansharma@infinera.com (ansharma@infinera.com)
Yan Shi (shiyan49@chinaunicom.cn)
Ricard Vilata (ricard.vilalta@cttc.es)
Karthik Sethuraman (karthik.sethuraman@necam.com)

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