RFC 9667: Dynamic Flooding on Dense Graphs
In plain English — editorial summary, not part of the RFC
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.
Document record
- Document ID
- RFC9667
- Published
- October 2024
- Authors
- T. Li; P. Psenak; H. Chen; L. Jalil; S. Dontula
- Status
- EXPERIMENTAL
- Stream
- IETF
- Area
- rtg
- Pages
- 41
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 9666Area Proxy for IS-ISCurrent
October 2024
- RFC 8965Applicability of the Babel Routing ProtocolCurrent
January 2021
- RFC 6621Simplified Multicast ForwardingCurrent
May 2012
- RFC 3719Recommendations for Interoperable Networks using Intermediate System to Intermediate System (IS-IS)Current
February 2004
- RFC 1245OSPF Protocol AnalysisCurrent
July 1991
- RFC 9657Time-Variant Routing (TVR) Use CasesCurrent
October 2024
- RFC 9656A YANG Data Model for Microwave TopologyCurrent
September 2024
- RFC 9681IS-IS Fast FloodingCurrent
November 2024
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?