Skip to main content

Dynamic Flooding on Dense Graphs

Approval announcement
Draft of message to be sent after approval:


From: The IESG <>
To: IETF-Announce <>
Cc: Acee Lindem <>, The IESG <>,,,,,,
Subject: Document Action: 'Dynamic Flooding on Dense Graphs' to Experimental RFC (draft-ietf-lsr-dynamic-flooding-18.txt)

The IESG has approved the following document:
- 'Dynamic Flooding on Dense Graphs'
  (draft-ietf-lsr-dynamic-flooding-18.txt) as Experimental RFC

This document is the product of the Link State Routing Working Group.

The IESG contact persons are Gunter Van de Velde, Jim Guichard and John

A URL of this Internet-Draft is:

Ballot Text

Technical Summary

   Routing with link state protocols in dense network topologies can
   result in sub-optimal 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.

Working Group Summary

   Per the shepherd writeup, "Initially, there was a controversy 
   with respect to distributed vs centralized computation of the 
   flooding topology. The draft evolved to support either model."

Document Quality

   Per the shepherd writeup, "There is one existing implementation. 
   It is not reported formally due to a change in affiliation of 
   the primary author."


   The Document Shepherd for this document is Acee Lindem. The Responsible
   Area Director is John Scudder.

RFC Editor Note