rfc-9667

Dynamic Flooding on Dense Graphs

T. Li (Editor), P. Psenak (Editor), H. Chen, L. Jalil, S. Dontula

date2024-10 streamIETF areartg wglsr statusEXPERIMENTAL pages41 canonicalhttps://www.rfc-editor.org/rfc/rfc9667 doi10.17487/RFC9667

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.