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

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2003, Pages 173-178

  Golab, Lukasz ^a   DeHaan, David ^a   Demaine, Erik D ^b   López Ortiz, Alejandro ^a   Munro, J Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Frequent item queries; Internet traffic monitoring; On line stream analysis; Sliding windows

Indexed keywords

ALGORITHMS; BANDWIDTH; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ONLINE SYSTEMS; QUALITY OF SERVICE; QUERY LANGUAGES; REAL TIME SYSTEMS;

FREQUENT ITEM QUERIES; INTERNET TRAFFIC MONITORING; ON-LINE STREAM ANALYSIS; SLIDING WINDOWS;

PACKET NETWORKS;

EID: 16344385372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/948205.948227     Document Type: Conference Paper

References (16)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data streams. Proc. 21st ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pages 1-16, 2002.
2. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Proc. 29th Int. Colloquium on Automata, Languages and Programming, pages 693-703, 2002.
3. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. Proc. 22nd ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pages 296-306, 2003.
4. C. Cranor, Y. Gao, T. Johnson, V. Shkapenyuk, and O. Spatscheck. Gigascope: High performance network monitoring with an sql interface. Proc. ACM SIGMOD Int. Conf. on Management of Data, page 623, 2002.
5. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. Proc. 13th SIAM-ACM Symp. on Discrete Algorithms, pages 635-644, 2002.
6. E. Demaine, A. Lopez-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. Proc. European Symposium on Algorithms, pages 348-360, 2002.
7. C. Estan and G. Varghese. New directions in traffic measurement and accounting. Proc. ACM SIGCOMM Internet Measurement Workshop, pages 75-80, 2001.
8. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. Ullman. Computing iceberg queries efficiently. Proc. 24th Int. Conf. on Very Large Data Bases, pages 299-310, 1998.
9. P. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 331-342, 1998.
10. L. Golab and M. T. Özsu. Issues in data stream management. ACM SIGMOD Record, 32(2):5-14, Jun. 2003.
11. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. Proc. 12th Int. Conf. on Data Engineering, pages 152-159, 1996.
12. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. Proc. 28th Int. Conf. on Very Large Data Bases, pages 346-357, 2002.
13. V. Paxson and S. Floyd. Wide-area traffic: The failure of poisson modeling. IEEE/ACM Trans. on Networking, 3(3):226-244, Jun. 1995.
14. L. Qiao, D. Agrawal, and A. El Abbadi. Supporting sliding window queries for continuous data streams. Proc. 15th Int. Conf. on Scientific and Statistical Database Management, 2003, to appear.
15. M. Sullivan and A. Heybey. Tribeca: A system for managing large databases of network traffic. Proc. USENIX Annual Technical Conf., 1998.
16. Y. Zhu and D. Shasha. StatStream: Statistical monitoring of thousands of data streams in real time. Proc. 28th Int. Conf. on Very Large Data Bases, pages 358-369, 2002.