Flooding Topology Computation Algorithm
draft-cc-lsr-flooding-reduction-09
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Huaimo Chen , Mehmet Toy , Yi Yang , Aijun Wang , Xufeng Liu , Yanhe Fan , Lei Liu | ||
| Last updated | 2020-12-07 (Latest revision 2020-06-05) | ||
| RFC stream | (None) | ||
| Intended RFC status | (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 proposes an algorithm for a node to compute a flooding topology, which is a subgraph of the complete topology per underline physical network. When every node in an area automatically calculates a flooding topology by using a same algorithm and floods the link states using the flooding topology, the amount of flooding traffic in the network is greatly reduced. This would reduce convergence time with a more stable and optimized routing environment.
Authors
Huaimo Chen
Mehmet Toy
Yi Yang
Aijun Wang
Xufeng Liu
Yanhe Fan
Lei Liu
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)