Subject: [Lsr] Fwd: New Version Notification for draft-li-dynamic-flooding-05.txt

From: [email-masked]
Date: Thu, 28 Jun 2018 08:48:38 -0700

FYI…

Significant changes since -04:

- Added Peter Psenak as co-author.
- Added OSPF LSA encodings.
- Added an option for a distributed topology computation. No algorithm specified at this time.

As always, comments are welcomed.

Regards,
Peter & Tony

> Begin forwarded message:
> 
> From: [email-masked]
> Subject: New Version Notification for draft-li-dynamic-flooding-05.txt
> Date: June 28, 2018 at 8:42:07 AM PDT
> To: "Peter Psenak" <[email-masked]>, "Tony Li" <[email-masked]>
> 
> 
> A new version of I-D, draft-li-dynamic-flooding-05.txt
> has been successfully submitted by Peter Psenak and posted to the
> IETF repository.
> 
> Name:		draft-li-dynamic-flooding
> Revision:	05
> Title:		Dynamic Flooding on Dense Graphs
> Document date:	2018-06-28
> Group:		Individual Submission
> Pages:		28
> URL:            https://www.ietf.org/internet-drafts/draft-li-dynamic-flooding-05.txt
> Status:         https://datatracker.ietf.org/doc/draft-li-dynamic-flooding/
> Htmlized:       https://tools.ietf.org/html/draft-li-dynamic-flooding-05
> Htmlized:       https://datatracker.ietf.org/doc/html/draft-li-dynamic-flooding
> Diff:           https://www.ietf.org/rfcdiff?url2=draft-li-dynamic-flooding-05
> 
> Abstract:
>   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 submission
> until the htmlized version and diff are available at tools.ietf.org.
> 
> The IETF Secretariat
>