Flooding Topology Computation Algorithm

The information below is for an old version of the document
Document Type None Internet-Draft (individual)
Last updated 2019-07-29 (latest revision 2019-07-07)
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized bibtex
Additional URLs
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Unknown state
Telechat date
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


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.


Huaimo Chen (huaimo.chen@futurewei.com)
Dean Cheng (deanccheng@gmail.com)
Mehmet Toy (mehmet.toy@verizon.com)
Yi Yang (yyietf@gmail.com)
Aijun Wang (wangaj.bri@chinatelecom.cn)
Xufeng Liu (xufeng.liu.ietf@gmail.com)
Yanhe Fan (yfan@casa-systems.com)
Lei Liu (liulei.kddi@gmail.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)