while I appreciate the flexibility associated with the centralized
computation of the flooding topology, it has some drawbacks as well:
1. "flooding topology" must be flooded. This makes the flooding
dependent on the flooded data itself.
2. The extra flooding of "flooding topology" adds some delay in the
convergence towards the new "flooding topology".
Have you considered the distributed computation of "flooding topology"
using some standardized algorithm?
Eventually we can support multiple standardized algorithms. A node can
advertise support for several algorithms and the "active" algorithm is
selected based on some criteria that would guarantee that all nodes in
the flooding domain select the same one.
On 27/03/18 18:07 , tony...@tony.li wrote:
I’ve submitted an updated version of my draft. Several changes:
- This collapses the two documents into one, so IS-IS is now included.
Placeholders are there for OSPF.
- I’ve expanded the discussion of failure modes.
- Minor bug fixes.
Your comments are solicited…
Begin forwarded message:
*From: *internet-dra...@ietf.org <mailto:internet-dra...@ietf.org>
*Subject: **New Version Notification for draft-li-dynamic-flooding-04.txt*
*Date: *March 27, 2018 at 9:01:30 AM PDT
*To: *"Tony Li" <tony...@tony.li <mailto:tony...@tony.li>>
A new version of I-D, draft-li-dynamic-flooding-04.txt
has been successfully submitted by Tony Li and posted to the
Title:Dynamic Flooding on Dense Graphs
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.
Please note that it may take a couple of minutes from the time of
until the htmlized version and diff are available at tools.ietf.org
The IETF Secretariat
Lsr mailing list
Lsr mailing list