Flooding Topology Minimum Degree Algorithm
draft-ietf-lsr-flooding-topo-min-degree-09
| Document | Type |
Expired Internet-Draft
(lsr WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Huaimo Chen , Mehmet Toy , Yi Yang , Aijun Wang , Xufeng Liu , Yanhe Fan , Lei Liu | ||
| Last updated | 2024-08-04 (Latest revision 2024-02-01) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | Acee Lindem | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | acee@cisco.com |
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.)