New Streaming Algorithms for Fast Detection of Superspreaders

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2005

Volumn , Issue , 2005, Pages

  Venkataraman, Shobha ^a   Song, Dawn ^a   Gibbons, Phillip B ^b   Blum, Avrim ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INTEL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTACK DETECTION; FAST DETECTIONS; HIGH SPEED; INTERNET TRAFFIC; MONITORING POINTS; NETWORK MONITORING; PACKET LEVEL; REAL- TIME; STREAMING ALGORITHM; TRAFFIC ENGINEERING;

NETWORK SECURITY;

EID: 85112686126     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. of Computer and System Sciences, 58:137-147, 1999.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issue in data stream systems. In Proc. 21st ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS), pages 1-16, June 2002.
3. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Proc. 6th International Workshop on Randomization and Approximation Techniques (RANDOM), pages 1-10, Sept. 2002. Lecture Notes in Computer Science, vol. 2483, Springer.
4. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2002.
5. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. In Allerton, 2002.
7. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya. Towards estimation error guarantees for distinct values. In Proc. 19th ACM Symp. on Principles of Database Systems, pages 268-279, May 2000.
8. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. 29th Intl. Colloq. on Automata, Languages, and Programming, 2002.
9. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. of Computer and System Sciences, 55(3):441-453, 1997.
10. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using hamming norms (how to zero in). In Proc. 28th International Conf. on Very Large Data Bases (VLDB), pages 335-345, Aug. 2002.
11. G. Cormode and S. Muthukrishnan. What's new: Finding significant differences in network data streams. In Proceedings of IEEE Infocom, 2004.
12. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 31(6):1794-1813, 2002.
13. E. Demaine, A. Lopez-Ortiz, and J. Ian-Munro. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms, pages 348-360, September 2002.
14. N. Duffield, C. Lund, and M. Thorup. Estimating flow distributions from sampled flow statistics. In Proceedings of ACM SIGCOMM, 2003.
15. C. Estan, S. Savage, and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. In Proceedings of SIGCOMM'03, 2003.
16. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proceedings of SIGCOMM'02, 2002.
17. C. Estan, G. Varghese, and M. Fisk. Bitmap algorithms for counting active flows on high speed links. In ACM SIGCOMM Internet Measurement Workshop, 2003.
18. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Computer and System Sciences, 31:182-209, 1985.
19. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 331-342, June 1998.
20. P. B. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 281-291, June 2001.
21. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 63-72, Aug. 2002.
22. L. Golab, D. DeHaan, E. Demaine, A. Lopez-Ortiz, and J. Ian-Munro. Identifying frequent items in sliding windows over online packet streams. In Proceedings of 2003 ACM SIGCOMM conference on Internet measurement, pages 173-178. ACM Press, 2003.
23. J. Jung, V. Paxson, A. Berger, and H. Balakrishnan. Fast portscan detection using sequential hypothesis testing. In Proceedings of the 2004 IEEE Symposium on Security and Privacy, May 2004.
24. R. Karp, S. Shenker, and C. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst., 28(1):51-55, 2003.
25. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of VLDB 2002, 2002.
26. D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. Inside the slammer worm. Security and Privacy Magazine, July/August 2003.
27. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 1995.
28. S. Muthukrishnan. Data streams: Algorithms and applications. Technical report, Rutgers University, Piscataway, NJ, 2003.
29. NLANR. National laboratory for applied network research. http://pma.nlanr.net/Traces/, 2003.
30. M. Roesch. Snort - lightweight intrusion detection for networks. In Proceedings of the 13th Systems Administration Conference. USENIX, 1999.
31. N. Weaver, S. Staniford, and V. Paxson. Very fast containment of scanning worms. In Proceedings of the 13th Usenix Security Conference. USENIX, August 2004.