Identifying frequent items in sliding windows over on-line packet streams

doi:10.1145/948205.948227

Identifying frequent items in sliding windows over on-line packet streams

Full Text:

Pdf

Buy this Article

Authors:	Lukasz Golab	University of Waterloo
	David DeHaan	University of Waterloo
	Erik D. Demaine	M.I.T
	Alejandro Lopez-Ortiz	University of Waterloo
	J. Ian Munro	University of Waterloo

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 6 · Downloads (12 Months): 50 · Citation Count: 26

Published in:

	· Proceeding
	IMC '03 Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
	ACM New York, NY, USA ©2003 table of contents ISBN:1-58113-773-7 doi>10.1145/948205.948227

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms frequent item queries internet traffic monitoring network monitoring on-line stream analysis sliding windows

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player