--- 1/draft-ietf-lsr-dynamic-flooding-06.txt 2020-06-23 09:13:17.385589192 -0700 +++ 2/draft-ietf-lsr-dynamic-flooding-07.txt 2020-06-23 09:13:17.473591377 -0700 @@ -1,30 +1,32 @@ Internet Engineering Task Force T. Li, Ed. Internet-Draft Arista Networks Intended status: Standards Track P. Psenak, Ed. -Expires: November 28, 2020 L. Ginsberg +Expires: December 25, 2020 L. Ginsberg Cisco Systems, Inc. H. Chen Futurewei T. Przygienda Juniper Networks, Inc. D. Cooper CenturyLink L. Jalil Verizon S. Dontula ATT - May 27, 2020 + G. Mishra + Verizon Inc. + June 23, 2020 Dynamic Flooding on Dense Graphs - draft-ietf-lsr-dynamic-flooding-06 + draft-ietf-lsr-dynamic-flooding-07 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, @@ -37,22 +39,21 @@ Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." - - This Internet-Draft will expire on November 28, 2020. + This Internet-Draft will expire on December 25, 2020. Copyright Notice Copyright (c) 2020 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents @@ -2043,24 +2045,24 @@ 2018, . 10.2. Informative References [Clos] Clos, C., "A Study of Non-Blocking Switching Networks", The Bell System Technical Journal Vol. 32(2), DOI 10.1002/j.1538-7305.1953.tb01433.x, March 1953, . [I-D.cc-lsr-flooding-reduction] - Chen, H., Cheng, D., Toy, M., Yang, Y., Wang, A., Liu, X., - Fan, Y., and L. Liu, "Flooding Topology Computation - Algorithm", draft-cc-lsr-flooding-reduction-08 (work in - progress), March 2020. + Chen, H., Toy, M., Yang, Y., Wang, A., Liu, X., Fan, Y., + and L. Liu, "Flooding Topology Computation Algorithm", + draft-cc-lsr-flooding-reduction-09 (work in progress), + June 2020. [Leiserson] Leiserson, C., "Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing", IEEE Transactions on Computers 34(10):892-901, 1985. [RFC2973] Balay, R., Katz, D., and J. Parker, "IS-IS Mesh Groups", RFC 2973, DOI 10.17487/RFC2973, October 2000, . @@ -2134,10 +2136,19 @@ Email: luay.jalil@verizon.com Srinath Dontula ATT 200 S Laurel Ave Middletown, New Jersey 07748 USA Email: sd947e@att.com + + Gyan S. Mishra + Verizon Inc. + 13101 Columbia Pike + Silver Spring, Maryland 20904 + USA + + Phone: 301 502-1347 + Email: gyan.s.mishra@verizon.com