Enhanced Network Traffic Anomaly Detection: Integration of Tensor Eigenvector Centrality with Low-Rank Recovery Models

被引:2
作者
Lin, Wei [1 ,2 ]
Li, Chen [1 ,2 ]
Xu, Li [1 ,2 ]
Xie, Kun [3 ,4 ]
机构
[1] Fujian Normal Univ, Coll Comp & Cyber Secur, Fuzhou 350117, Peoples R China
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350117, Peoples R China
[3] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410012, Hunan, Peoples R China
[4] Minist Educ, Lab Supercomp & Artificial Intelligence Comp Educ, Changsha 410012, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensors; Telecommunication traffic; Anomaly detection; Data models; Accuracy; Matrix decomposition; Monitoring; Network traffic; tensor decomposition; anomaly detection; centrality; machine learning; NONLINEAR DIMENSIONALITY REDUCTION; ACCURATE; CLASSIFICATION; FACTORIZATION;
D O I
10.1109/TSC.2024.3433580
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In service computing, network traffic anomaly detection is pivotal for monitoring and identifying irregularities in network traffic to uphold the security, reliability, and stability of networks and services. In network traffic data, centrality is exhibited as certain nodes more frequently act as communication sources or destinations, or play critical intermediary roles in the network. These structures are also among the targets of network bottlenecks and targeted attacks. Current unsupervised network traffic anomaly detection algorithms, based on low-rank tensor recovery, achieve effective detection performance by comprehensively capturing network information. However, these algorithms often neglect the underlying topological structure, focusing solely on linear data structures, which leads to overlooking the degree of traffic concentration and nonlinear data structures. It reduces the detection efficiency of abnormal traffic generated by targeted attacks. To comprehensively understand the evolution of traffic concentration over time, this study introduces a mathematical formula for tensor eigenvector edge centrality. The formula provides rankings of edge importance based on the significance of nodes and time layers, and the effectiveness of centrality is validated through structural perturbations in the network. On this basis, we design a low-rank tensor recovery model utilizing representation learning to obtain the centrality feature matrix of network traffic data. By encoding centrality for nonlinear proximity information, and incorporating the Laplacian matrix to capture nonlinear structural information in tensor decomposition, the accuracy of anomaly detection is enhanced. Extensive experiments on Abilene and G & Egrave;ANT network traffic data demonstrate that our proposed algorithm not only achieves higher precision and recall rates in random anomalies but also performs better in detecting anomalous traffic generated by high centrality structures compared to state of art algorithms based on matrix-based anomaly detection and tensor recovery methods.
引用
收藏
页码:3597 / 3612
页数:16
相关论文
共 53 条
[1]  
abilene.internet2, 2003, The abilene observatory data collections
[2]   Comparison and Detection Analysis of Network Traffic Datasets Using K-Means Clustering Algorithm [J].
Al-Sanjary, Omar Ismael ;
Bin Roslan, Muhammad Aiman ;
Helmi, Rabab Alayham Abbas ;
Ahmed, Ahmed Abdullah .
JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT, 2020, 19 (03)
[3]   Betweenness in time dependent networks [J].
Alsayed, Ahmad ;
Higham, Desmond J. .
CHAOS SOLITONS & FRACTALS, 2015, 72 :35-48
[4]  
Anandkumar A, 2016, JMLR WORKSH CONF PRO, V51, P268
[5]  
[Anonymous], 2006, P 12 ACM SIGKDD INT, DOI DOI 10.1145/1150402.1150445
[6]  
[Anonymous], 1869, J. Reine Angew. Math.
[7]   Anomaly detection of network-initiated LTE signaling traffic in wireless sensor and actuator networks based on a Hidden semi-Markov Model [J].
Bang, June-ho ;
Cho, Young-jong ;
Kang, Kyungran .
COMPUTERS & SECURITY, 2017, 65 :108-120
[8]  
Belkin M, 2002, ADV NEUR IN, V14, P585
[9]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[10]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)