What's new: Finding significant differences in network data streams

IEEE/ACM Transactions on Networking

Volumn 13, Issue 6, 2005, Pages 1219-1232

  Cormode, Graham ^a,b   Muthukrishnan, S ^a  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Change detection; Data streams; Deltoids; Network data analysis

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PROBABILITY; ROUTERS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

CHANGE DETECTION; DATA STREAMS; IP NETWORKS; NETWORK DATA ANALYSIS;

INTERNET;

EID: 29844455221     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.860096     Document Type: Article

References (32)

1. Internet Traffic Achive [Online]. Available: http://ita.ee.lbl.gov/
2. Proc. Workshop on Management and Processing of Data Streams (MPDS), San Diego, CA, Jun. 2003.
3. N. Alon, P. Gibbons, Y Matias, and M. Szegedy, "Tracking join and self-join sizes in limited storage," in Proc. 18th ACM Symp. Principles of Database Systems, 1999, pp. 10-20.
4. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," in Proc. 28th Annu. ACM Symp. Theory of Computing, 1996, pp. 20-29.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, "Models and issues in data stream systems," in Proc. Symp. Principles of Database Systems, 2002, pp. 1-16.
6. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," in Proc. Int. Colloq. Automata, Languages and Programming (ICALP), 2002, pp. 693-703.
7. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan, "Comparing data streams using Hamming norms," in Proc. 28th Int. Conf. Very Large Data Bases, 2002, pp. 335-345.
8. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava, "Finding hierarchical heavy hitters in data streams;" in Proc. 29th Int. Conf. Very Large Databases, 2003, pp. 464-475.
9. G. Cormode and S. Muthukrishnan, "Estimating dominance norms of multiple data streams," in Proc. 11th Eur. Symp. Algorithms (ESA), Lecture Notes in Computer Science vol. 2838, 2003, pp. 148-160.
10. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," in Proc. ACM Principles of Database Systems, 2003, pp. 296-306.
11. G. Cormode and S. Muthukrishnan, "An improved data stream summary: The count-min sketch and its applications," J. Algorithms, vol. 55, no. 1, pp. 58-75, Apr. 2005.
12. M. Datar and S. Muthukrishnan, "Estimating rarity and similarity over data stream windows," in Proc. 10th Annu. Eur. Symp. Algorithms, Lecture Notes in Computer Science vol. 2461, 2002, pp. 323-334.
13. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and its Applications. Singapore: World Scientific, 1993, vol. 3, Series on Applied Mathematics.
14. C. Estan, S. Savage, and G. Varghese, "Automatically inferring patterns of resource consumption in network traffic," in Proc. ACM SIGCOMM, 2003, pp. 137-148.
15. C. Estan and G. Varghese, "New directions in traffic measurement and accounting," Proc. ACM SIGCOMM, Comput. Commun. Rev., vol. 32, no. 4, pp. 323-338, 2002.
16. C. Estan and G. Varghese, "Data streaming in computer networking," in Proc. Workshop on Management and Processing of Data Streams (MPDS), San Diego, CA, 2003. [Online.] http:/ /www.research.att.com/conf/mpds2003/ schedule/estanV.ps.
17. C. Estan, G. Varghese, and M. Fisk, "Bitmap algorithms for counting active flows on high speed links," in Proc. Internet Measurement Conference, 2003, pp. 153-166.
18. 1-difference algorithm for massive data streams," in Proc. 40th Annu. Symp. Foundations of Computer Science, 1999, pp. 501-511.
19. M. Garofalakis, J. Gehrke, and R. Rastogi, "Querying and mining data streams: You only get one look," in Proc. ACM SIGMOD Int. Conf. Management of Data, Madison, WI, 2002, p. 635.
20. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss, "Fast, small-space algorithms for approximate histogram maintenance," in Proc. 34th ACM Symp. Theory of Computing, 2002, pp. 389-398.
21. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, "QuickSAND: Quick Summary and Analysis of Network Data," DIMACS, Tech. Repo. 2001-43, 2001.
22. M. Henzinger, "Algorithmic challenges in search engines," Internet Math., vol. 1, no. 1, pp. 115-126, 2003.
23. P. Indyk, "Stable distributions, pseudorandom generators, embeddings and data stream computation," in Proc. 40th Symp. Foundations of Computer Science, 2000, pp. 189-197.
24. R. Karp, C. Papadimitriou, and S. Shenker, "A simple algorithm for finding frequent elements in sets and bags," ACM Trans. Database Syst., vol. 28, no. 1, pp. 51-55, Mar. 2003.
25. B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, "Sketch-based change detection: Methods, evaluation and applications," in Proc. Internet Measurement Conf., 2003, pp. 234-247.
26. E. Kushilevitz and Y. Mansour, "Learning decision trees using the fourier spectrum," SIAM J. Computing, vol. 22, no. 6, pp. 1331-1348, 1993.
27. G. S. Manku and R. Motwani, "Approximate frequency counts over data streams," in Proc. 28th Int. Conf. Very Large Data Bases, 2002, pp. 346-357.
28. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
29. S. Muthukrishnan, "Data streams: Algorithms and applications," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms, 2003, p. 413.
30. V. Paxson, "Empirically derived analytic models of wide-area tcp connections," IEEE ACM Trans. Netw., vol. 2, no. 4, pp. 316-336, Aug. 1994.
31. G. Varghese, "Detecting packet patterns at high speeds," presented at the ACM SIGCOMM, Tutorial, Pittsburgh, PA, 2002.
32. V. Yegneswaran, P. Barford, and J. Ullrich, "Internet intrusions: Global characteristics and prevalence," in Proc. ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Systems (SIGMETRICS-03), vol. 31, 1 of Performance Evaluation Review, 2003, pp. 138-147.