S2F-GNN: A self-supervised robust encrypted traffic classification method based on dynamic heterogeneous graphs

IF 6.3 2区 计算机科学 Q1 TELECOMMUNICATIONS
Digital Communications and Networks Pub Date : 2026-09-01 Epub Date: 2026-05-20 DOI:10.1016/j.dcan.2026.05.002
Jiangtao Zhai, Lejun Shen, Shuo Wu, Kai Chen, Guangjie Liu
{"title":"S2F-GNN: A self-supervised robust encrypted traffic classification method based on dynamic heterogeneous graphs","authors":"Jiangtao Zhai,&nbsp;Lejun Shen,&nbsp;Shuo Wu,&nbsp;Kai Chen,&nbsp;Guangjie Liu","doi":"10.1016/j.dcan.2026.05.002","DOIUrl":null,"url":null,"abstract":"<div><div>Encrypted traffic classification is a critical task in network security and management. However, existing methods often neglect the structural and multi-dimensional correlations of traffic. Furthermore, their heavy reliance on large-scale labeled data limits their generalization ability in dynamic networks. To address the above limitations, this paper proposes a novel few-shot encrypted traffic classification framework based on self-supervised learning (S<sup>2</sup>F-GNN). Firstly, we represent network sessions as dynamic heterogeneous graphs consisting of flow, time, and attribute nodes. This representation effectively captures the structural features and temporal evolution of traffic in a multi-dimensional space. Secondly, we design a multi-task self-supervised framework that synergizes masked autoencoder, graph structure prediction, clustering, and contrastive learning. This framework efficiently learns universal and robust traffic representations from large-scale unlabeled data. In addition, we design a Jensen-Shannon Divergence (JSD)-based feature selection mechanism to identify features that remain stable across changing environments. This further enhances the model’s adaptability in few-shot and dynamic scenarios. Experimental results demonstrate that S<sup>2</sup>F-GNN significantly outperforms the state-of-the-art methods on multiple public datasets. Especially in the few-shot scenarios with scarce labeled data, the average accuracy and F1-score are improved by 4.04% and 9.68%, respectively.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 9","pages":"Pages 1442-1460"},"PeriodicalIF":6.3000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S235286482600060X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/5/20 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Encrypted traffic classification is a critical task in network security and management. However, existing methods often neglect the structural and multi-dimensional correlations of traffic. Furthermore, their heavy reliance on large-scale labeled data limits their generalization ability in dynamic networks. To address the above limitations, this paper proposes a novel few-shot encrypted traffic classification framework based on self-supervised learning (S2F-GNN). Firstly, we represent network sessions as dynamic heterogeneous graphs consisting of flow, time, and attribute nodes. This representation effectively captures the structural features and temporal evolution of traffic in a multi-dimensional space. Secondly, we design a multi-task self-supervised framework that synergizes masked autoencoder, graph structure prediction, clustering, and contrastive learning. This framework efficiently learns universal and robust traffic representations from large-scale unlabeled data. In addition, we design a Jensen-Shannon Divergence (JSD)-based feature selection mechanism to identify features that remain stable across changing environments. This further enhances the model’s adaptability in few-shot and dynamic scenarios. Experimental results demonstrate that S2F-GNN significantly outperforms the state-of-the-art methods on multiple public datasets. Especially in the few-shot scenarios with scarce labeled data, the average accuracy and F1-score are improved by 4.04% and 9.68%, respectively.
S2F-GNN:基于动态异构图的自监督鲁棒加密流量分类方法
加密流分类是网络安全和管理中的一项关键任务。然而,现有的方法往往忽略了交通的结构性和多维相关性。此外,它们对大规模标记数据的严重依赖限制了它们在动态网络中的泛化能力。为了解决上述局限性,本文提出了一种基于自监督学习(S2F-GNN)的新型少射加密流量分类框架。首先,我们将网络会话表示为由流量、时间和属性节点组成的动态异构图。这种表示有效地捕捉了多维空间中交通的结构特征和时间演变。其次,我们设计了一个多任务自监督框架,协同掩码自编码器、图结构预测、聚类和对比学习。该框架有效地从大规模未标记数据中学习通用和鲁棒的流量表示。此外,我们设计了一个基于Jensen-Shannon Divergence (JSD)的特征选择机制,以识别在变化的环境中保持稳定的特征。这进一步增强了模型对少镜头和动态场景的适应性。实验结果表明,在多个公共数据集上,S2F-GNN显著优于最先进的方法。特别是在标记数据稀缺的少镜头场景下,平均准确率和f1得分分别提高了4.04%和9.68%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Digital Communications and Networks
Digital Communications and Networks Computer Science-Hardware and Architecture
CiteScore
12.80
自引率
5.10%
发文量
915
审稿时长
30 weeks
期刊介绍: Digital Communications and Networks is a prestigious journal that emphasizes on communication systems and networks. We publish only top-notch original articles and authoritative reviews, which undergo rigorous peer-review. We are proud to announce that all our articles are fully Open Access and can be accessed on ScienceDirect. Our journal is recognized and indexed by eminent databases such as the Science Citation Index Expanded (SCIE) and Scopus. In addition to regular articles, we may also consider exceptional conference papers that have been significantly expanded. Furthermore, we periodically release special issues that focus on specific aspects of the field. In conclusion, Digital Communications and Networks is a leading journal that guarantees exceptional quality and accessibility for researchers and scholars in the field of communication systems and networks.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书