<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-lsr-dynamic-flooding" target="https://datatracker.ietf.org/doc/html/draft-ietf-lsr-dynamic-flooding-12">
   <front>
      <title>Dynamic Flooding on Dense Graphs</title>
      <author initials="T." surname="Li" fullname="Tony Li">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="T." surname="Przygienda" fullname="Tony Przygienda">
         <organization>Juniper Networks</organization>
      </author>
      <author initials="P." surname="Psenak" fullname="Peter Psenak">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="L." surname="Ginsberg" fullname="Les Ginsberg">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="H." surname="Chen" fullname="Huaimo Chen">
         <organization>Futurewei</organization>
      </author>
      <author initials="L." surname="Jalil" fullname="Luay Jalil">
         <organization>Verizon</organization>
      </author>
      <author initials="S." surname="Dontula" fullname="Srinath Dontula">
         <organization>ATT</organization>
      </author>
      <author initials="G. S." surname="Mishra" fullname="Gyan Mishra">
         <organization>Verizon Inc.</organization>
      </author>
      <date month="February" day="24" year="2023" />
      <abstract>
	 <t>   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.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-lsr-dynamic-flooding-12" />
   
</reference>
