--- 1/draft-ietf-lsr-dynamic-flooding-03.txt 2019-11-26 08:13:22.494696291 -0800 +++ 2/draft-ietf-lsr-dynamic-flooding-04.txt 2019-11-26 08:13:22.594698853 -0800 @@ -1,30 +1,30 @@ Internet Engineering Task Force T. Li, Ed. Internet-Draft Arista Networks Intended status: Standards Track P. Psenak, Ed. -Expires: December 6, 2019 L. Ginsberg +Expires: May 29, 2020 L. Ginsberg Cisco Systems, Inc. H. Chen Futurewei T. Przygienda Juniper Networks, Inc. D. Cooper CenturyLink L. Jalil Verizon S. Dontula ATT - June 4, 2019 + November 26, 2019 Dynamic Flooding on Dense Graphs - draft-ietf-lsr-dynamic-flooding-03 + draft-ietf-lsr-dynamic-flooding-04 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, @@ -38,21 +38,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 December 6, 2019. + This Internet-Draft will expire on May 29, 2020. Copyright Notice Copyright (c) 2019 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 @@ -126,21 +126,21 @@ 7.1. IS-IS . . . . . . . . . . . . . . . . . . . . . . . . . . 38 7.2. OSPF . . . . . . . . . . . . . . . . . . . . . . . . . . 39 7.2.1. OSPF Dynamic Flooding LSA TLVs Registry . . . . . . . 41 7.2.2. OSPF Link Attributes Sub-TLV Bit Values Registry . . 41 7.3. IGP . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 8. Security Considerations . . . . . . . . . . . . . . . . . . . 42 9. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 43 10. References . . . . . . . . . . . . . . . . . . . . . . . . . 43 10.1. Normative References . . . . . . . . . . . . . . . . . . 43 10.2. Informative References . . . . . . . . . . . . . . . . . 45 - Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 46 + Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 45 1. Introduction In recent years, there has been increased focus on how to address the dynamic routing of networks that have a bipartite (a.k.a. spine-leaf or leaf-spine), Clos [Clos], or Fat Tree [Leiserson] topology. Conventional Interior Gateway Protocols (IGPs, i.e., IS-IS [ISO10589], OSPFv2 [RFC2328], and OSPFv3 [RFC5340]) under-perform, redundantly flooding information throughout the dense topology, leading to overloaded control plane inputs and thereby creating @@ -1956,21 +1956,21 @@ this work. The authors would like to thank Zeqing (Fred) Xia, Naiming Shen, Adam Sweeney and Olufemi Komolafe for their helpful comments. The authors would like to thank Tom Edsall for initially introducing them to the problem. Advertising Local Edges Enabled for Flooding (LEEF) is based on an idea proposed in [I-D.cc-lsr-flooding-reduction]. We wish to thank - the authors of that draft - in particular Huaimo Chen. + the authors of that draft. 10. References 10.1. Normative References [ISO10589] International Organization for Standardization, "Intermediate System to Intermediate System Intra-Domain Routing Exchange Protocol for use in Conjunction with the Protocol for Providing the Connectionless-mode Network @@ -2003,29 +2003,20 @@ [RFC5310] Bhatia, M., Manral, V., Li, T., Atkinson, R., White, R., and M. Fanto, "IS-IS Generic Cryptographic Authentication", RFC 5310, DOI 10.17487/RFC5310, February 2009, . [RFC5340] Coltun, R., Ferguson, D., Moy, J., and A. Lindem, "OSPF for IPv6", RFC 5340, DOI 10.17487/RFC5340, July 2008, . - [RFC5613] Zinin, A., Roy, A., Nguyen, L., Friedman, B., and D. - Yeung, "OSPF Link-Local Signaling", RFC 5613, - DOI 10.17487/RFC5613, August 2009, - . - - [RFC7120] Cotton, M., "Early IANA Allocation of Standards Track Code - Points", BCP 100, RFC 7120, DOI 10.17487/RFC7120, January - 2014, . - [RFC7356] Ginsberg, L., Previdi, S., and Y. Yang, "IS-IS Flooding Scope Link State PDUs (LSPs)", RFC 7356, DOI 10.17487/RFC7356, September 2014, . [RFC7474] Bhatia, M., Hartman, S., Zhang, D., and A. Lindem, Ed., "Security Extension for OSPFv2 When Using Manual Key Management", RFC 7474, DOI 10.17487/RFC7474, April 2015, . @@ -2056,23 +2047,23 @@ 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, "LS Distributed Flooding Reduction", - draft-cc-lsr-flooding-reduction-03 (work in progress), - March 2019. + Fan, Y., and L. Liu, "Flooding Topology Computation + Algorithm", draft-cc-lsr-flooding-reduction-07 (work in + progress), October 2019. [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, .