Synecdoche: Efficient and Accurate In-Network Traffic Classification via Direct Packet Sequential Pattern Matching

📅 2025-12-24
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
To address the inherent trade-off between accuracy and efficiency in traffic classification on programmable data planes, this paper proposes a lightweight temporal pattern matching framework based on Key Segments. We introduce a novel “offline deep mining–online hardware matching” paradigm, which for the first time compresses packet-level temporal features into hardware-acceleratable key segments. Our approach integrates P4 compiler optimizations, compact hash tables, and SRAM-aware encoding to enable real-time line-rate processing. Experimental evaluation demonstrates that our method achieves a 26.4% improvement in F1-score over statistical baselines and an 18.3% gain over online deep learning approaches, while reducing latency by 13.0% and SRAM footprint by 79.2%. The framework supports full line-rate classification at 100 Gbps on commodity programmable switches.

Technology Category

Application Category

📝 Abstract
Traffic classification on programmable data plane holds great promise for line-rate processing, with methods evolving from per-packet to flow-level analysis for higher accuracy. However, a trade-off between accuracy and efficiency persists. Statistical feature-based methods align with hardware constraints but often exhibit limited accuracy, while online deep learning methods using packet sequential features achieve superior accuracy but require substantial computational resources. This paper presents Synecdoche, the first traffic classification framework that successfully deploys packet sequential features on a programmable data plane via pattern matching, achieving both high accuracy and efficiency. Our key insight is that discriminative information concentrates in short sub-sequences--termed Key Segments--that serve as compact traffic features for efficient data plane matching. Synecdoche employs an "offline discovery, online matching" paradigm: deep learning models automatically discover Key Segment patterns offline, which are then compiled into optimized table entries for direct data plane matching. Extensive experiments demonstrate Synecdoche's superior accuracy, improving F1-scores by up to 26.4% against statistical methods and 18.3% against online deep learning methods, while reducing latency by 13.0% and achieving 79.2% reduction in SRAM usage. The source code of Synecdoche is publicly available to facilitate reproducibility and further research.
Problem

Research questions and friction points this paper is trying to address.

Achieves high accuracy and efficiency in traffic classification
Deploys packet sequential features via pattern matching on data planes
Uses Key Segments for efficient matching with reduced resource usage
Innovation

Methods, ideas, or system contributions that make the work stand out.

Uses Key Segments as compact features for pattern matching
Employs offline deep learning to discover patterns for online matching
Compiles patterns into table entries for direct data plane matching
M
Minyuan Xiao
Beihang University
Y
Yunchun Li
Beihang University
Y
Yuchen Zhao
Beihang University
Tong Guan
Tong Guan
SUNY at Buffalo
Mingyuan Xia
Mingyuan Xia
McGill University
Mobile Systems and ApplicationsProgram AnalysisStorage SystemsVirtualization
W
Wei Li
Beihang University