@misc{rfc9667,
    series =    {Request for Comments},
    number =    9667,
    howpublished =  {RFC 9667},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC9667},
    url =       {https://www.rfc-editor.org/info/rfc9667},
    author =    {Tony Li and Peter Psenak and Huaimo Chen and Luay Jalil and Srinath Dontula},
    title =     {{Dynamic Flooding on Dense Graphs}},
    pagetotal = 41,
    year =      2024,
    month =     oct,
    abstract =  {Routing with link-state protocols in dense network topologies can result in suboptimal convergence times due to the overhead associated with flooding. This can be addressed by decreasing the flooding topology so that it is less dense. This document discusses the problem in some depth and an architectural solution. Specific protocol changes for IS-IS, OSPFv2, and OSPFv3 are described in this document.},
}