draft-ietf-opsawg-large-flow-load-balancing-03.txt		draft-ietf-opsawg-large-flow-load-balancing-04.txt
	OPSAWG R. Krishnan		OPSAWG R. Krishnan
	Internet Draft S. Khanna		Internet Draft S. Khanna
	Intended status: Informational Brocade Communications		Intended status: Informational Brocade Communications
	Expires: January 25, 2014 L. Yong		Expires: January 9, 2014 L. Yong
	July 9, 2013 Huawei USA		July 9, 2013 Huawei USA
	A. Ghanwani		A. Ghanwani
	Dell		Dell
	Ning So		Ning So
	Tata Communications		Tata Communications
	B. Khasnabish		B. Khasnabish
	ZTE Corporation		ZTE Corporation
	Mechanisms for Optimal LAG/ECMP Component Link Utilization in		Mechanisms for Optimal LAG/ECMP Component Link Utilization in
	Networks		Networks
	draft-ietf-opsawg-large-flow-load-balancing-03.txt		draft-ietf-opsawg-large-flow-load-balancing-04.txt
	Status of this Memo		Status of this Memo
	This Internet-Draft is submitted in full conformance with the		This Internet-Draft is submitted in full conformance with the
	provisions of BCP 78 and BCP 79. This document may not be modified,		provisions of BCP 78 and BCP 79. This document may not be modified,
	and derivative works of it may not be created, except to publish it		and derivative works of it may not be created, except to publish it
	as an RFC and to translate it into languages other than English.		as an RFC and to translate it into languages other than English.
	Internet-Drafts are working documents of the Internet Engineering		Internet-Drafts are working documents of the Internet Engineering
	Task Force (IETF), its areas, and its working groups. Note that		Task Force (IETF), its areas, and its working groups. Note that
	skipping to change at page 1, line 42		skipping to change at page 1, line 42
	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."
	The list of current Internet-Drafts can be accessed at		The list of current Internet-Drafts can be accessed at
	http://www.ietf.org/ietf/1id-abstracts.txt		http://www.ietf.org/ietf/1id-abstracts.txt
	The list of Internet-Draft Shadow Directories can be accessed at		The list of Internet-Draft Shadow Directories can be accessed at
	http://www.ietf.org/shadow.html		http://www.ietf.org/shadow.html
	This Internet-Draft will expire on January 9, 2009.		This Internet-Draft will expire on January 9, 2014.
	Copyright Notice		Copyright Notice
	Copyright (c) 2013 IETF Trust and the persons identified as the		Copyright (c) 2013 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
	(http://trustee.ietf.org/license-info) in effect on the date of		(http://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
	skipping to change at page 21, line 33		skipping to change at page 21, line 33
	the ACM SIGCOMM, August 2011.		the ACM SIGCOMM, August 2011.
	[NDTM] Estan, C. and G. Varghese, "New directions in traffic		[NDTM] Estan, C. and G. Varghese, "New directions in traffic
	measurement and accounting," Proceedings of ACM SIGCOMM, August 2002.		measurement and accounting," Proceedings of ACM SIGCOMM, August 2002.
	[bin-pack] Coffman, Jr., E., M. Garey, and D. Johnson. Approximation		[bin-pack] Coffman, Jr., E., M. Garey, and D. Johnson. Approximation
	Algorithms for Bin-Packing -- An Updated Survey. In Algorithm Design		Algorithms for Bin-Packing -- An Updated Survey. In Algorithm Design
	for Computer System Design, ed. by Ausiello, Lucertini, and Serafini.		for Computer System Design, ed. by Ausiello, Lucertini, and Serafini.
	Springer-Verlag, 1984.		Springer-Verlag, 1984.
	Appendix A. Internet Traffic Analysis and Load Balancing Simulation		Appendix A. Internet Traffic Analysis and Load Balancing Simulation
	Internet traffic [CAIDA] has been analyzed to obtain flow statistics		Internet traffic [CAIDA] has been analyzed to obtain flow statistics
	such as the number of packets in a flow and the flow duration. The		such as the number of packets in a flow and the flow duration. The
	five tuples in the packet header (IP addresses, TCP/UDP Ports, and IP		five tuples in the packet header (IP addresses, TCP/UDP Ports, and IP
	protocol) are used for flow identification. The analysis indicates		protocol) are used for flow identification. The analysis indicates
	that < ~2% of the flows take ~30% of total traffic volume while the		that < ~2% of the flows take ~30% of total traffic volume while the
	rest of the flows (> ~98%) contributes ~70% [YONG].		rest of the flows (> ~98%) contributes ~70% [YONG].
	The simulation has shown that given Internet traffic pattern, the		The simulation has shown that given Internet traffic pattern, the
	hash-based technique does not evenly distribute the flows over ECMP		hash-based technique does not evenly distribute the flows over ECMP
End of changes. 4 change blocks.
	4 lines changed or deleted		4 lines changed or added
This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/