LD-Sketch: A distributed sketching design for accurate and scalable anomaly detection in network data streams

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1420-1428

  Huang, Qun ^a   Lee, Patrick P C ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS;

ANOMALY DETECTION; DISTRIBUTED ARCHITECTURE; DISTRIBUTED DETECTION; MULTIPLE DETECTION; OPERATIONAL NETWORK; REAL-TIME CHARACTERIZATIONS; SPACE AND TIME COMPLEXITY; TRAFFIC ANOMALY DETECTIONS;

SCALABILITY;

EID: 84904437367     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848076     Document Type: Conference Paper

References (22)

1. Apache Flume. http://flume.apache.org.
2. T. Bu, J. Cao, A. Chen, and P. P. Lee. Sequential Hashing: A Flexible Approach for Unveiling Significant Patterns in High Speed Networks. Computer Networks, 54(18):3309-3326, 2010.
3. M. Charikar, K. Chen, and M. Farach-Colton. Finding Frequent Items in Data Streams. Theoretical Computer Science, 312(1):3-15, 2004.
4. G. Cormode and M. Garofalakis. Sketching Streams Through the Net: Distributed Approximate Query Tracking. In Proc. of VLDB, 2005.
5. G. Cormode, M. Garofalakis, P. J. Haas, and C. Jermaine. Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches. Now Publishers Inc., Jan. 2012.
6. G. Cormode and M. Hadjieleftheriou. Methods for Finding Frequent Items in Data Streams. VLDB Journal, 19(1):3-20, 2010.
7. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Finding Hierarchical Heavy Hitters in Data Streams. In Proc. of VLDB, 2003.
8. G. Cormode and S. Muthukrishnan. What's New: Finding Significant Differences in Network Data Streams. In Proc. of INFOCOM, 2004.
9. G. Cormode and S. Muthukrishnan. An Improved Data Stream Summary: The Count-Min Sketch and its Applications. Journal of Algorithms, 55(1):58-75, 2005.
10. X. Dimitropoulos, P. Hurley, and A. Kind. Probabilistic Lossy Counting: An Efficient Algorithm for Finding Heavy Hitters. SIGCOMM Comput. Commun. Rev., 38(1):5-5, Jan. 2008.
11. C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice. TOCS, 21(3):270-313, 2003.
12. X. He, P. P. C. Lee, L. Pan, C. He, and J. C. S. Lui. A panoramic view of 3G data/control-plane traffic: Mobile device perspective. In Proc. of IFIP/TC6 Networking, 2012.
13. B. Krishnamurthy, S. Sen, Y. Zhang, F. Park, and Y. Chen. Sketch-based Change Detection: Methods, Evaluation, and Applications. In Proc. of IMC, 2003.
14. Y. Liu, W. Chen, and Y. Guan. A Fast Sketch for Aggregate Queries over High-Speed Network Traffic. In Proc. of INFOCOM, 2012.
15. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (Recently) Frequent Items in Distributed Data Streams. In Proc. of ICDE, 2005.
16. G. S. Manku and R. Motwani. Approximate Frequency Counts over Data Streams. In Proc. of VLDB, 2002.
17. A. Metwally, D. Agrawal, and A. E. Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams. In Proc. of ICDT, 2005.
18. J. Misra and D. Gries. Finding Repeated Elements. In Science of Comput Program 2, 1982.
19. L. Neumeyer, B. Robbins, A. Nair, and A. Kesari. S4: Distributed Stream Computing Platform. In KDCloud, Dec. 2010.
20. R. Schweller, Z. Li, Y. Chen, Y. Gao, A. Gupta, Y. Zhang, P. Dinda, M. Y. Kao, and G. Memik. Reversible Sketches: Enabling Monitoring and Analysis over High-Speed Data Streams. IEEE/ACM Transactions on Networking, 15(5):1059-1072, 2007.
21. Storm. https://github.com/nathanmarz/storm.
22. K. Yi and Q. Zhang. Optimal Tracking of Distributed Heavy Hitters and Quantiles. In Proceedings of PODS, 2009.