ISIS Flooding Reduction
draft-cc-isis-flooding-reduction-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Huaimo Chen , Dean Cheng , Mehmet Toy , Yi Yang | ||
| Last updated | 2018-11-05 (Latest revision 2018-04-29) | ||
| Stream | (None) | ||
| Intended RFC status | (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) |
https://www.ietf.org/archive/id/draft-cc-isis-flooding-reduction-01.txt
Abstract
This document proposes an approach to flood ISIS link state protocol data units on a topology that is a subgraph of the complete ISIS topology per underline physical network, so that the amount of flooding traffic in the network is greatly reduced, and it would reduce convergence time with a more stable and optimized routing environment. The approach can be applied to any network topology in a single ISIS area.
Authors
Huaimo Chen
Dean Cheng
Mehmet Toy
Yi Yang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)