Traffic dispersion graph based anomaly detection

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 36-41

  Le, Do Quoc ^a   Jeong, Taeyoel ^a   Roman, H Eduardo ^a   Hong, James Won Ki ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

anomalous traffic detection; DDoS attacks; network monitoring and analysis; network security; traffic dispersion graphs

Indexed keywords

ANOMALY DETECTION; ATTACK PATTERNS; DDOS ATTACK; DEGREE DISTRIBUTIONS; DISPERSION GRAPH; IP NETWORKS; MAXIMUM DEGREE; MODEL NETWORKS; NETWORK MONITORING AND ANALYSIS; NETWORK TRAFFIC; THEORY CONCEPT; TRAFFIC DETECTION;

COMMUNICATION; COMPUTER CRIME; DISPERSIONS; GRAPH THEORY; INFORMATION TECHNOLOGY; TIME SERIES;

NETWORK SECURITY;

EID: 82955197456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2069216.2069227     Document Type: Conference Paper

References (24)

1. Iliofotou, M., Pappu, P., Faloutsos, M., Mitzenmacher, M. Singh, S. and Varghese, G. Network monitoring using traffic dispersion graphs (tdgs). In Proceedings of the 7th ACM SIGCOMM conference on Internet measurement (IMC '07). ACM, New York, NY, USA, 2007, 315-320. DOI= http://doi.acm.org/10.1145/1298306. 1298349
2. Hick, P., Aben, E., Claffy, K. and Polterock, J.2007.The CAIDA DDoS Attack 2007 Dataset. http://www.caida.org/data/passive/ddos- 20070804dataset.xml (accessed on 2011-05-10).
3. Eberle, W. and Holder, L. 2007. Anomaly detection in data represented as graphs. Intelligent Data Analysis, 2007, vol. 11, pp. 663-689.
4. Noble, C.C. and Cook, D. J. 2003. Graph-based anomaly detection. In Proceedings of the 9th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, 2003, 631-636.
5. Cook, D.J. and Holder, L.B. 2000. Graph-based data mining. IEEE Intelligent Systems, 2000, 15(2), pages 32-41. (Pubitemid 30587666)
6. Ide, T. and Kashima, H. 2004. Eigenspace-based anomaly detection in computer systems. Conference on Knowledge Discovery in Data: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, 2004, 22(25):440-449.
7. Sun, J., Faloutsos, C., Papadimitriou, S. and Yu, P.S. 2007. GraphScope: parameter-free mining of large time-evolving graphs. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 2007, pages 687-696.
8. Chandola, V., Banerjee, A. and Kumar, V. 2009. Anomaly detection: A survey. ACM Comput. Surv, (July 2009), Article 15, 58 pages. DOI= http://doi.acm.org/10.1145/1541880.1541882
9. Zhou, Y., Hu, G., He, W. 2009. Using graph to detect network traffic anomaly. Conference on Communications Circuits and Systems, 2009. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5 250514
10. Iliofotou, M., Faloutsos, M. and Mitzenmacher, M. 2009. Exploiting dynamicity in graph-based traffic analysis: techniques and applications. In Proceedings of the 5th international conference on Emerging networking experiments and technologies (CoNEXT '09). ACM, New York, NY, USA, 2009, 241-252. DOI= http://doi.acm.org/10.1145/1658939.1658967
11. Godiyal, A., Garland, M. and John, C.H. 2010. Enhancing network traffic visualization by graph pattern analysis. https://agora.cs.illinois.edu/download/ attachments/18744303/ NetflowPatternGraph.pdf?version=1&modificationDate=123 8354953000.
12. Papadimitriou, P., Dasdan, A. and Garcia-Molina, H. 2008. Web graph similarity for anomaly detection. Technical Report, Stanford University, 2008. http://dbpubs.stanford.edu/pub/2008-1.pdf
13. Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H. and Zhao, B. 2010. Measurement-calibrated graph models for social network experiments. In WWW, 2010, pages 861-870.
14. Mahadevan, P., Hubble, C., Krioukov, D., Huffaker, B., Vahdat, A. 2007. Orbis: rescaling degree correlations to generate annotated Internet topologies. SIGCOMM Computer Communications Review, 2007, 325-336.
15. Conte, D., Foggia, P., Sansone, C., Vento, M. 2004. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 2004, 18 (3) 265-298.
16. Bunke, H. 2000. Recent developments in graph matching. In Proc. 15th International Conference on Pattern Recognition, 2000, pages 117-124.
17. Cordella, L.P., Foggia, P., Sansone, C. and Vento, M. 2004. A (Sub)Graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26, 10 (October 2004), 1367-1372. DOI= http://dx.doi.org/10.1109/TPAMI. 2004.75
18. Hong, J.W. 2004. Internet traffic monitoring and analysis using NG-MON. POSTECH, Advanced Communication Technology. The 6th International Conference, 2004, Volume: 1, page(s): 100- 120. http://ieeexplore.ieee.org/iel5/9073/28786/ 01292840.pdf
19. Gansner, E., Koutsofios E. and North, S.Drawing graphs with dot. http://www.graphviz.org/Documentation/dotguide.pdf
20. Whitney, D. 2008. Basic Network Metrics. Lecture note. http://ocw.mit.edu/courses/engineering-systems-division/esd- 342-network-representations-of-complex-engineeringsystems- spring- 2010/readings/MITESD-342S10-ntwk-metrics.pdf
21. Graphviz - graph visualization software. http://www.graphviz.org/
22. Foggia, P., Sansone, C. and Vento, M. 2001. A Performance Comparison of Five Algorithms for Graph Isomorphism. Proc. 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
23. Voss, S. and Subhlok, J. 2010. Performance of general graph isomorphism algorithms. Technical Report UH-CS-09-07, University of Houston, 2010.
24. Kristoff, J. 2004. Botnets. 32nd Meeting of the North American Network Operators Group, October, 2004