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

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-07-25 DOI:10.1109/TSC.2024.3433580
Wei Lin;Chen Li;Li Xu;Kun Xie
{"title":"Enhanced Network Traffic Anomaly Detection: Integration of Tensor Eigenvector Centrality with Low-Rank Recovery Models","authors":"Wei Lin;Chen Li;Li Xu;Kun Xie","doi":"10.1109/TSC.2024.3433580","DOIUrl":null,"url":null,"abstract":"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È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.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"3597-3612"},"PeriodicalIF":5.8000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10609543/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

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È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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
增强型网络流量异常检测:张量特征向量中心性与低级别恢复模型的整合
在业务计算中,网络流量异常检测是监控和识别网络流量异常的关键,可以保障网络和业务的安全、可靠、稳定。在网络流量数据中,中心性表现为某些节点更频繁地充当通信源或目的地,或在网络中扮演关键的中介角色。这些结构也是网络瓶颈和针对性攻击的目标之一。目前的无监督网络流量异常检测算法是基于低秩张量恢复,通过全面捕获网络信息来实现有效的检测性能。然而,这些算法往往忽略了底层的拓扑结构,只关注线性数据结构,从而忽略了流量集中程度和非线性数据结构。降低了对针对性攻击产生的异常流量的检测效率。为了全面理解交通集中度随时间的演变,本研究引入了张量特征向量边缘中心性的数学公式。该公式根据节点和时间层的重要性提供边缘重要性排序,并通过网络中的结构扰动验证中心性的有效性。在此基础上,利用表示学习设计了低秩张量恢复模型,获得网络流量数据的中心性特征矩阵。通过对非线性接近信息进行中心性编码,结合拉普拉斯矩阵在张量分解中捕捉非线性结构信息,提高了异常检测的精度。在Abilene和GÈANT网络流量数据上的大量实验表明,与基于矩阵的异常检测和张量恢复方法的现有算法相比,我们提出的算法不仅在随机异常中实现了更高的准确率和召回率,而且在检测由高中心性结构产生的异常流量方面表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
HSSCOA: Constant-Round Secure Collaborative Analytics on Secret-Shared Database PAHPA: Revolutionizing Kubernetes Autoscaling with Integrated Predictive Analytics and Real-Time Monitoring PrivTI: Efficient End-to-End Privacy-Preserving Inference for Transformer-based Models in MLaaS NER-AD: Noise-Robust Reconstruction Enhanced by Representation-Learning for Metric Anomaly Detection in Online Service Systems Decentralized Load Balancing in Urban Edge computing with Spatial Modeling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1