Hi,

The authors would again like to request that we progress this document.

Thanks,
Tony


> Begin forwarded message:
> 
> From: "internet-drafts at ietf.org" <[email protected]>
> Subject: New Version Notification for 
> draft-ietf-lsr-dynamic-flooding-algorithm-01.txt
> Date: January 30, 2026 at 9:36:41 PM PST
> To: "Sarah Chen" <[email protected]>, "Tony Li" <[email protected]>
> Reply-To: [email protected]
> 
> A new version of Internet-Draft
> draft-ietf-lsr-dynamic-flooding-algorithm-01.txt has been successfully
> submitted by Tony Li and posted to the
> IETF repository.
> 
> Name:     draft-ietf-lsr-dynamic-flooding-algorithm
> Revision: 01
> Title:    An Algorithm for Computing Dynamic Flooding Topologies
> Date:     2026-01-30
> Group:    lsr
> Pages:    10
> URL:      
> https://www.ietf.org/archive/id/draft-ietf-lsr-dynamic-flooding-algorithm-01.txt
> Status:   
> https://datatracker.ietf.org/doc/draft-ietf-lsr-dynamic-flooding-algorithm/
> HTML:     
> https://www.ietf.org/archive/id/draft-ietf-lsr-dynamic-flooding-algorithm-01.html
> HTMLized: 
> https://datatracker.ietf.org/doc/html/draft-ietf-lsr-dynamic-flooding-algorithm
> Diff:     
> https://author-tools.ietf.org/iddiff?url2=draft-ietf-lsr-dynamic-flooding-algorithm-01
> 
> 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 Secretariat
> 
> 

_______________________________________________
Lsr mailing list -- [email protected]
To unsubscribe send an email to [email protected]

Reply via email to