< draft-ietf-lsr-dynamic-flooding-04.txt		draft-ietf-lsr-dynamic-flooding-05.txt >
	Internet Engineering Task Force T. Li, Ed.		Internet Engineering Task Force T. Li, Ed.
	Internet-Draft Arista Networks		Internet-Draft Arista Networks
	Intended status: Standards Track P. Psenak, Ed.		Intended status: Standards Track P. Psenak, Ed.
	Expires: May 29, 2020 L. Ginsberg		Expires: November 18, 2020 L. Ginsberg
	Cisco Systems, Inc.		Cisco Systems, Inc.
	H. Chen		H. Chen
	Futurewei		Futurewei
	T. Przygienda		T. Przygienda
	Juniper Networks, Inc.		Juniper Networks, Inc.
	D. Cooper		D. Cooper
	CenturyLink		CenturyLink
	L. Jalil		L. Jalil
	Verizon		Verizon
	S. Dontula		S. Dontula
	ATT		ATT
	November 26, 2019		May 17, 2020
	Dynamic Flooding on Dense Graphs		Dynamic Flooding on Dense Graphs
	draft-ietf-lsr-dynamic-flooding-04		draft-ietf-lsr-dynamic-flooding-05
	Abstract		Abstract
	Routing with link state protocols in dense network topologies can		Routing with link state protocols in dense network topologies can
	result in sub-optimal convergence times due to the overhead		result in sub-optimal convergence times due to the overhead
	associated with flooding. This can be addressed by decreasing the		associated with flooding. This can be addressed by decreasing the
	flooding topology so that it is less dense.		flooding topology so that it is less dense.
	This document discusses the problem in some depth and an		This document discusses the problem in some depth and an
	architectural solution. Specific protocol changes for IS-IS, OSPFv2,		architectural solution. Specific protocol changes for IS-IS, OSPFv2,
	skipping to change at page 1, line 49 ¶		skipping to change at page 1, line 49 ¶
	Internet-Drafts are working documents of the Internet Engineering		Internet-Drafts are working documents of the Internet Engineering
	Task Force (IETF). Note that other groups may also distribute		Task Force (IETF). Note that other groups may also distribute
	working documents as Internet-Drafts. The list of current Internet-		working documents as Internet-Drafts. The list of current Internet-
	Drafts is at https://datatracker.ietf.org/drafts/current/.		Drafts is at https://datatracker.ietf.org/drafts/current/.
	Internet-Drafts are draft documents valid for a maximum of six months		Internet-Drafts are draft documents valid for a maximum of six months
	and may be updated, replaced, or obsoleted by other documents at any		and may be updated, replaced, or obsoleted by other documents at any
	time. It is inappropriate to use Internet-Drafts as reference		time. It is inappropriate to use Internet-Drafts as reference
	material or to cite them other than as "work in progress."		material or to cite them other than as "work in progress."
	This Internet-Draft will expire on May 29, 2020.		This Internet-Draft will expire on November 18, 2020.
	Copyright Notice		Copyright Notice
	Copyright (c) 2019 IETF Trust and the persons identified as the		Copyright (c) 2020 IETF Trust and the persons identified as the
	document authors. All rights reserved.		document authors. All rights reserved.
	This document is subject to BCP 78 and the IETF Trust's Legal		This document is subject to BCP 78 and the IETF Trust's Legal
	Provisions Relating to IETF Documents		Provisions Relating to IETF Documents
	(https://trustee.ietf.org/license-info) in effect on the date of		(https://trustee.ietf.org/license-info) in effect on the date of
	publication of this document. Please review these documents		publication of this document. Please review these documents
	carefully, as they describe your rights and restrictions with respect		carefully, as they describe your rights and restrictions with respect
	to this document. Code Components extracted from this document must		to this document. Code Components extracted from this document must
	include Simplified BSD License text as described in Section 4.e of		include Simplified BSD License text as described in Section 4.e of
	the Trust Legal Provisions and are provided without warranty as		the Trust Legal Provisions and are provided without warranty as
	skipping to change at page 45, line 20 ¶		skipping to change at page 45, line 20 ¶
	10.2. Informative References		10.2. Informative References
	[Clos] Clos, C., "A Study of Non-Blocking Switching Networks",		[Clos] Clos, C., "A Study of Non-Blocking Switching Networks",
	The Bell System Technical Journal Vol. 32(2), DOI		The Bell System Technical Journal Vol. 32(2), DOI
	10.1002/j.1538-7305.1953.tb01433.x, March 1953,		10.1002/j.1538-7305.1953.tb01433.x, March 1953,
	<http://dx.doi.org/10.1002/j.1538-7305.1953.tb01433.x>.		<http://dx.doi.org/10.1002/j.1538-7305.1953.tb01433.x>.
	[I-D.cc-lsr-flooding-reduction]		[I-D.cc-lsr-flooding-reduction]
	Chen, H., Cheng, D., Toy, M., Yang, Y., Wang, A., Liu, X.,		Chen, H., Cheng, D., Toy, M., Yang, Y., Wang, A., Liu, X.,
	Fan, Y., and L. Liu, "Flooding Topology Computation		Fan, Y., and L. Liu, "Flooding Topology Computation
	Algorithm", draft-cc-lsr-flooding-reduction-07 (work in		Algorithm", draft-cc-lsr-flooding-reduction-08 (work in
	progress), October 2019.		progress), March 2020.
	[Leiserson]		[Leiserson]
	Leiserson, C., "Fat-Trees: Universal Networks for		Leiserson, C., "Fat-Trees: Universal Networks for
	Hardware-Efficient Supercomputing", IEEE Transactions on		Hardware-Efficient Supercomputing", IEEE Transactions on
	Computers 34(10):892-901, 1985.		Computers 34(10):892-901, 1985.
	[RFC2973] Balay, R., Katz, D., and J. Parker, "IS-IS Mesh Groups",		[RFC2973] Balay, R., Katz, D., and J. Parker, "IS-IS Mesh Groups",
	RFC 2973, DOI 10.17487/RFC2973, October 2000,		RFC 2973, DOI 10.17487/RFC2973, October 2000,
	<https://www.rfc-editor.org/info/rfc2973>.		<https://www.rfc-editor.org/info/rfc2973>.
End of changes. 6 change blocks.
	7 lines changed or deleted		7 lines changed or added
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/