DBF-PSR: a dual-branch fusion approach to network traffic classification using protocol semantic representation

With the widespread adoption of encrypted traffic and the scarcity of annotated data in specific network traffic domains, traditional network traffic classification methods face significant challenges in achieving effective performance. In this context, the “self-supervised learning + supervised learning” paradigm has emerged as a promising approach to enhance classification accuracy. However, existing methods often treat network traffic as opaque data, relying on models to autonomously learn semantic representations from raw inputs, while neglecting the rich prior knowledge embedded in network protocols. To address this limitation, we propose a novel network traffic classification model–DBF-PSR. DBF-PSR introduces a specialized tokenization strategy to enhance the semantic clarity of traffic data. During the self-supervised learning phase, it learns generalizable packet-level representations of protocol fields. In the domain-specific supervised learning stage, DBF-PSR utilizes the packet-level embeddings generated during previous stage and incorporates a dual-branch complementary mechanism to capture session-level representations. This hierarchical feature learning framework significantly boosts classification performance. We evaluate DBF-PSR on three representative traffic analysis tasks. Experimental results show that DBF-PSR outperforms state-of-the-art methods, achieving Macro F1-scores improvements of 1.29% to 11.7%, demonstrating strong adaptability to complex traffic patterns. Furthermore, under few-shot scenarios (with 10%, 20%, and 50% of training data), DBF-PSR improves Macro F1-scores by 2.35% to 18.93% over baseline methods, indicating its robustness and high accuracy in data-scarce environments.

Authors

Institutions

Publication Details

Journal
Journal of King Saud University - Computer and Information Sciences
Published
2025-08-25
DOI
https://doi.org/10.1007/s44443-025-00233-w
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DBF-PSR: a dual-branch fusion approach to network traffic classification using protocol semantic representation

Yaojun Ding, Wei Chen
Journal of King Saud University - Computer and Information Sciences
Internet Traffic Analysis and Secure E-voting
article

DBF-PSR: a dual-branch fusion approach to network traffic classification using protocol semantic representation

Yaojun Ding, Wei Chen
article en

Abstract

With the widespread adoption of encrypted traffic and the scarcity of annotated data in specific network traffic domains, traditional network traffic classification methods face significant challenges in achieving effective performance. In this context, the “self-supervised learning + supervised learning” paradigm has emerged as a promising approach to enhance classification accuracy. However, existing methods often treat network traffic as opaque data, relying on models to autonomously learn semantic representations from raw inputs, while neglecting the rich prior knowledge embedded in network protocols. To address this limitation, we propose a novel network traffic classification model–DBF-PSR. DBF-PSR introduces a specialized tokenization strategy to enhance the semantic clarity of traffic data. During the self-supervised learning phase, it learns generalizable packet-level representations of protocol fields. In the domain-specific supervised learning stage, DBF-PSR utilizes the packet-level embeddings generated during previous stage and incorporates a dual-branch complementary mechanism to capture session-level representations. This hierarchical feature learning framework significantly boosts classification performance. We evaluate DBF-PSR on three representative traffic analysis tasks. Experimental results show that DBF-PSR outperforms state-of-the-art methods, achieving Macro F1-scores improvements of 1.29% to 11.7%, demonstrating strong adaptability to complex traffic patterns. Furthermore, under few-shot scenarios (with 10%, 20%, and 50% of training data), DBF-PSR improves Macro F1-scores by 2.35% to 18.93% over baseline methods, indicating its robustness and high accuracy in data-scarce environments.

Journal of King Saud University - Computer and Information SciencesVol. 37(7)
Gansu Institute of Political Science and Law (CN)
Strong
Openalex Percentile: Top 88%
Internet Traffic Analysis and Secure E-voting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

DBF-PSR: a dual-branch fusion approach to network traffic classification using protocol semantic representation — Yaojun Ding, Wei Chen · Journal of King Saud University - Computer and Information Sciences (2025) | TGRS Research Map | TGRS