Hi,
We have submitted a draft that describes the Arista algorithm for computing flooding topologies. This draft is informational and we are not proposing that this transition to the standards track. If the working group chooses to do further work based on this, we have no objections. Regards, Sarah & Tony > Begin forwarded message: > > From: internet-dra...@ietf.org > Subject: New Version Notification for > draft-chen-lsr-dynamic-flooding-algorithm-00.txt > Date: March 3, 2020 at 10:16:37 AM PST > To: "Yunxia Chen" <sarahc...@arista.com>, "Tony Li" <tony...@tony.li>, "Sarah > Chen" <sarahc...@arista.com> > > > A new version of I-D, draft-chen-lsr-dynamic-flooding-algorithm-00.txt > has been successfully submitted by Tony Li and posted to the > IETF repository. > > Name: draft-chen-lsr-dynamic-flooding-algorithm > Revision: 00 > Title: An Algorithm for Computing Dynamic Flooding Topologies > Document date: 2020-03-03 > Group: Individual Submission > Pages: 9 > URL: > https://www.ietf.org/internet-drafts/draft-chen-lsr-dynamic-flooding-algorithm-00.txt > Status: > https://datatracker.ietf.org/doc/draft-chen-lsr-dynamic-flooding-algorithm/ > Htmlized: > https://tools.ietf.org/html/draft-chen-lsr-dynamic-flooding-algorithm-00 > Htmlized: > https://datatracker.ietf.org/doc/html/draft-chen-lsr-dynamic-flooding-algorithm > > > 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. > > > > > Please note that it may take a couple of minutes from the time of submission > until the htmlized version and diff are available at tools.ietf.org. > > The IETF Secretariat > >
_______________________________________________ Lsr mailing list Lsr@ietf.org https://www.ietf.org/mailman/listinfo/lsr
