A prototypical alignment approach to unknown traffic classification using BERT

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Computer Networks Pub Date : 2026-03-01 Epub Date: 2026-01-30 DOI:10.1016/j.comnet.2026.112062
Minho Cho , Yongseok Kwon , Seyoung Ahn , Sunwon Kwon , Sunghyun Cho
{"title":"A prototypical alignment approach to unknown traffic classification using BERT","authors":"Minho Cho ,&nbsp;Yongseok Kwon ,&nbsp;Seyoung Ahn ,&nbsp;Sunwon Kwon ,&nbsp;Sunghyun Cho","doi":"10.1016/j.comnet.2026.112062","DOIUrl":null,"url":null,"abstract":"<div><div>As encrypted internet traffic continues to increase, classifying previously unseen traffic has become a major challenge in real-world network environments. Traditional traffic classification models are designed for closed-world scenarios and struggle to process novel traffic types. To address this in real-world network environments, coarse-grained classification approaches have been proposed, which assign all unknown traffic to a single <em>”unknown”</em> class. However, this coarse-grained labeling limits the model’s ability to perform the fine-grained classification of diverse and encrypted traffic behaviors. To address this, we propose Unknown Traffic Prototypical Alignment Bidirectional encoder representations from transformers (UT-PAB), a semi-supervised learning framework for the fine-grained classification of unknown traffic in open-world scenarios. UT-PAB operates in two phases: (1) a pre-training phase that learns general traffic patterns through supervised and masked token prediction tasks, and (2) a fine-tuning phase that refines representations using contrastive learning and prototype-based supervision. These two phases enable the model to cluster unknown traffic by semantic similarity without relying on protocol-specific features. We evaluated the effectiveness of UT-PAB on two benchmark datasets, ISCX-VPN and USTC-TFC, by comparing it against baseline methods based on clustering and representation learning. We conducted extensive experiments on two benchmark datasets across various unknown traffic ratios and demonstrated that the proposed method outperformed state-of-the-art methods by a minimum of 10.63%p and a maximum of 75.34%p improvement in overall accuracy.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112062"},"PeriodicalIF":4.7000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128626000745","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/30 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

As encrypted internet traffic continues to increase, classifying previously unseen traffic has become a major challenge in real-world network environments. Traditional traffic classification models are designed for closed-world scenarios and struggle to process novel traffic types. To address this in real-world network environments, coarse-grained classification approaches have been proposed, which assign all unknown traffic to a single ”unknown” class. However, this coarse-grained labeling limits the model’s ability to perform the fine-grained classification of diverse and encrypted traffic behaviors. To address this, we propose Unknown Traffic Prototypical Alignment Bidirectional encoder representations from transformers (UT-PAB), a semi-supervised learning framework for the fine-grained classification of unknown traffic in open-world scenarios. UT-PAB operates in two phases: (1) a pre-training phase that learns general traffic patterns through supervised and masked token prediction tasks, and (2) a fine-tuning phase that refines representations using contrastive learning and prototype-based supervision. These two phases enable the model to cluster unknown traffic by semantic similarity without relying on protocol-specific features. We evaluated the effectiveness of UT-PAB on two benchmark datasets, ISCX-VPN and USTC-TFC, by comparing it against baseline methods based on clustering and representation learning. We conducted extensive experiments on two benchmark datasets across various unknown traffic ratios and demonstrated that the proposed method outperformed state-of-the-art methods by a minimum of 10.63%p and a maximum of 75.34%p improvement in overall accuracy.
一种基于BERT的未知流量分类的原型对齐方法
随着加密互联网流量的不断增加,对以前看不见的流量进行分类已成为现实世界网络环境中的主要挑战。传统的流量分类模型是为封闭世界场景设计的,难以处理新的流量类型。为了在现实网络环境中解决这个问题,提出了粗粒度分类方法,将所有未知流量分配到单个“未知”类。然而,这种粗粒度标记限制了模型对各种加密流量行为执行细粒度分类的能力。为了解决这个问题,我们提出了来自变压器的未知流量原型对齐双向编码器表示(UT-PAB),这是一种半监督学习框架,用于开放世界场景中未知流量的细粒度分类。UT-PAB分为两个阶段:(1)预训练阶段,通过监督和屏蔽令牌预测任务学习一般的流量模式;(2)微调阶段,使用对比学习和基于原型的监督来改进表示。这两个阶段使模型能够通过语义相似性对未知流量进行聚类,而不依赖于特定于协议的特性。我们通过将UT-PAB与基于聚类和表示学习的基线方法进行比较,评估了UT-PAB在两个基准数据集(ISCX-VPN和USTC-TFC)上的有效性。我们在不同未知流量比率的两个基准数据集上进行了广泛的实验,并证明所提出的方法在总体精度上优于最先进的方法,其提高幅度最小为10.63%p,最大为75.34%p。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信
小红书