@techreport{cc-lsr-flooding-reduction-09,
    number =    {draft-cc-lsr-flooding-reduction-09},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-cc-lsr-flooding-reduction/09/},
    author =    {Huaimo Chen and Mehmet Toy and Yi Yang and Aijun Wang and Xufeng Liu and Yanhe Fan and Lei Liu},
    title =     {{Flooding Topology Computation Algorithm}},
    pagetotal = 12,
    year =      2020,
    month =     jun,
    day =       5,
    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.},
}