Multiple Algorithm support for IS-IS Prefixes
draft-chunduri-lsr-isis-prefix-multi-algo-00
The information below is for an old version of the document.
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Uma Chunduri , Yingzhen Qu | ||
| Last updated | 2018-10-19 (Latest revision 2018-04-17) | ||
| Stream | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| 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 can be found at:
https://www.ietf.org/archive/id/draft-chunduri-lsr-isis-prefix-multi-algo-00.txt
https://www.ietf.org/archive/id/draft-chunduri-lsr-isis-prefix-multi-algo-00.txt
Abstract
This document specifies an extension to Intermediate System to Intermediate System (IS-IS) protocol by adding an Algorithm support for prefixes advertised. This allows multiple independent algorithm usage for computing the reachability of nodes and prefixes as opposed to only one algorithm.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)