• DocumentCode
    3388892
  • Title

    Using graph to detect network traffic anomaly

  • Author

    Zhou, Yingjie ; Hu, Guangmin ; He, Weisong

  • Author_Institution
    Key Lab. of Broadband Opt. Fiber Transm. & Commun. Networks, UESTC, Chengdu, China
  • fYear
    2009
  • fDate
    23-25 July 2009
  • Firstpage
    341
  • Lastpage
    345
  • Abstract
    Comprehensive collection and accurate description of traffic information are core problems in network traffic anomaly detection. Aiming at the lack of traffic anomaly detection in analyzing multi-time series, we propose a network traffic anomaly detection method based on graph mining. Our method accurately and completely describes the relationships among multi-time series which are used in traffic anomaly detection by time-series graph; by means of the support count of the patterns, our method mines all the frequent patterns ,which is conducive to detecting many kinds of abnormal traffic effectively; through mining the relationships among all itemsets, our method introduces weight coefficients of the itemsets, which is able to solve relationship quantification issues of multi-time series in traffic anomaly detection. The simulation results show that the proposed method can effectively detect the network traffic anomaly and achieve a higher accuracy than the CWT-based (continuous wavelet transform-based) method in term of DDos attacks detection.
  • Keywords
    graph theory; security of data; telecommunication traffic; time series; wavelet transforms; continuous wavelet transform-based method; graph mining; network traffic anomaly detection; time-series graph; Computer crime; Continuous wavelet transforms; Data mining; Discrete wavelet transforms; Helium; Itemsets; Signal analysis; Telecommunication traffic; Time series analysis; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Circuits and Systems, 2009. ICCCAS 2009. International Conference on
  • Conference_Location
    Milpitas, CA
  • Print_ISBN
    978-1-4244-4886-9
  • Electronic_ISBN
    978-1-4244-4888-3
  • Type

    conf

  • DOI
    10.1109/ICCCAS.2009.5250514
  • Filename
    5250514