DyGCN: Dynamic Graph Convolution Network-based Anomaly Network Traffic Detection
Traditional abnormal network traffic detection methods only consider statistical features and ignore structural relationships, which makes them difficult to detect advanced attacks. In this paper, we propose DyGCN(Dynamic Graph Convolution Network) for anomaly network traffic detection. Firstly, we represent the network at a given time with a graph using hosts as nodes and construct a graph stream according to the dynamic network. We propose a dynamic graph model with structural learning and temporal learning for hosts. Secondly, we put forward a normal traffic pattern-based contrastive learning method by analyzing the structural characteristics of normal traffic. Thirdly, we obtain the graph representation with edge anomaly probability-based graph embedding method to mine the anomalous substructures in the graph. Finally, we use an anomaly detection model to judge the anomaly of the current network. Experimental results on two datasets demonstrate that DyGCN outperforms traditional anomaly detection methods and state-of-the-art dynamic graph embedding methods.
Authors
- Hao Xu (ORCID: https://orcid.org/0000-0001-9847-7904)
- Xiaoqing Zhang (ORCID: https://orcid.org/0000-0002-8114-7121)
- Yonghao Gu (ORCID: https://orcid.org/0000-0001-8021-097X)
- Tiejun Wu (ORCID: https://orcid.org/0000-0001-7748-964X)
Institutions
- NSK (United States) (US)
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-12-17
- DOI
- https://doi.org/10.1109/trustcom63139.2024.00253
- Citations
- 2
- Primary Topic
- Network Security and Intrusion Detection
- Type
- article
- Field-Weighted Citation Impact
- 0.70
Funders
- National Natural Science Foundation of China