Internet-Draft draft-ietf-lsr-dynamic-flooding-algorithm-01.txt is now
available. It is a work item of the Link State Routing (LSR) WG of the IETF.
Title: An Algorithm for Computing Dynamic Flooding Topologies
Authors: Sarah Chen
Tony Li
Name: draft-ietf-lsr-dynamic-flooding-algorithm-01.txt
Pages: 10
Dates: 2026-01-30
Abstract:
Link-state routing protocols suffer from excessive flooding in dense
network topologies. Dynamic flooding [I-D.ietf-lsr-dynamic-flooding]
alleviates the problem by decoupling the flooding topology from the
physical topology. Link-state protocol updates are flooded only on
the sparse flooding topology while data traffic is still forwarded on
the physical topology.
This document describes an algorithm to obtain a sparse subgraph from
a dense graph. The resulting subgraph has certain desirable
properties and can be used as a flooding topology in dynamic
flooding.
This document discloses the algorithm that we have developed in order
to make it easier for other developers to implement similar
algorithms. We do not claim that our algorithm is optimal, rather it
is a pragmatic effort and we expect that further research and
refinement can improve the results.
We are not proposing that this algorithm be standardized, nor that
the working group use this as a basis for further standardization
work, however we have no objections if the working group chooses to
do so.
The IETF datatracker status page for this Internet-Draft is:
https://datatracker.ietf.org/doc/draft-ietf-lsr-dynamic-flooding-algorithm/
There is also an HTML version available at:
https://www.ietf.org/archive/id/draft-ietf-lsr-dynamic-flooding-algorithm-01.html
A diff from the previous version is available at:
https://author-tools.ietf.org/iddiff?url2=draft-ietf-lsr-dynamic-flooding-algorithm-01
Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts
_______________________________________________
Lsr mailing list -- [email protected]
To unsubscribe send an email to [email protected]
