Fast and accurate traffic matrix measurement using adaptive cardinality counting

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fast and accurate traffic matrix measurement using adaptive cardinality counting

Full text

Pdf (303 KB)

Source

Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data table of contents

Philadelphia, Pennsylvania, USA

SESSION: Traffic analysis and infrastructure monitoring table of contents

Pages: 205 - 206

Year of Publication: 2005

ISBN:1-59593-026-4

Authors

Min Cai	University of Southern California
Jianping Pan	NTT MCL
Yu-Kwong Kwok	University of Southern California
Kai Hwang	University of Southern California

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 27, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080173.1080185 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	NLANR Moat PMA trace archive. See http://pma.nlanr.net/Traces.
	2	Nick Duffield , Carsten Lund , Mikkel Thorup, Estimating flow distributions from sampled flow statistics, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany [doi>10.1145/863955.863992]
	3	M. Durand and P. Flajolet. Loglog counting of large cardinalities. In 11th Annual European Symposium on Algorithms, Sept. 2003.
	4	Cristian Estan , George Varghese , Mike Fisk, Bitmap algorithms for counting active flows on high speed links, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, October 27-29, 2003, Miami Beach, FL, USA [doi>10.1145/948205.948225]
	5	Abhishek Kumar , Minho Sung , Jun (Jim) Xu , Jia Wang, Data streaming algorithms for efficient and accurate estimation of flow size distribution, Proceedings of the joint international conference on Measurement and modeling of computer systems, June 10-14, 2004, New York, NY, USA
	6	Anukool Lakhina , Mark Crovella , Christophe Diot, Diagnosing network-wide traffic anomalies, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
	7	Alex C. Snoeren , Craig Partridge , Luis A. Sanchez , Christine E. Jones , Fabrice Tchakountio , Beverly Schwartz , Stephen T. Kent , W. Timothy Strayer, Single-packet IP traceback, IEEE/ACM Transactions on Networking (TON), v.10 n.6, p.721-734, December 2002 [doi>10.1109/TNET.2002.804827]
	8	Kyu-Young Whang , Brad T. Vander-Zanden , Howard M. Taylor, A linear-time probabilistic counting algorithm for database applications, ACM Transactions on Database Systems (TODS), v.15 n.2, p.208-229, June 1990 [doi>10.1145/78922.78925]

CITED BY 2

	Aiyou Chen , Jin Cao , Tian Bu, A simple and efficient estimation method for stream expression cardinalities, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Min Cai , Kai Hwang , Jianping Pan , Christos Papadopoulos, WormShield: Fast Worm Signature Generation with Distributed Fingerprint Aggregation, IEEE Transactions on Dependable and Secure Computing, v.4 n.2, p.88-104, April 2007