RFC 9667
Dynamic Flooding on Dense Graphs, October 2024
- File formats:
- Also available: XML file for editing
- Status:
- EXPERIMENTAL
- Authors:
- T. Li, Ed.
P. Psenak, Ed.
H. Chen
L. Jalil
S. Dontula - Stream:
- IETF
- Source:
- lsr (rtg)
Cite this RFC: TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC9667
Discuss this RFC: Send questions or comments to the mailing list lsr@ietf.org
Other actions: Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 9667
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.
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.