YANG Model for IGP Flexible Algorithm
draft-rasool-lsr-flex-algo-yang-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Mobashshera Rasool , Sreekanth S , Mahendra Singh Negi | ||
| Last updated | 2019-10-30 (Latest revision 2019-04-28) | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| 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
This document describes a YANG data model for IGP Flexible Algorithm. The model serves as a base framework for configuring and managing Flexible Algorithms which is used by IGPs to compute constraint based paths over the network.
Authors
Mobashshera Rasool
Sreekanth S
Mahendra Singh Negi
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)