Pruned Traffic Trees: Native Semantic Compression with a Protocol-Structured Model Family for Encrypted Traffic Classification

• URL: http://arxiv.org/abs/2608.21874v1
• Date: Sat, 22 Aug 2026 09:33:49 GMT
• Title: Pruned Traffic Trees: Native Semantic Compression with a Protocol-Structured Model Family for Encrypted Traffic Classification
• Abstract summary: Pruned Traffic Trees (PTT) are a three-level protocol-structured model family that treats native protocol structures as compression units.<n>We show that treating protocol structure itself as the compression object enables effective performance-efficiency trade-offs for lightweight encrypted traffic classification.
• Score: 5.6697818519339345
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep learning has achieved strong performance in encrypted traffic classification (ETC), yet its computational cost limits deployment on resource-constrained network devices such as routers and middleboxes. Existing compression methods mainly operate on weights, channels, hidden representations, or predictions, but do not explicitly determine which protocol fields and structural contexts should remain. We propose Pruned Traffic Trees (PTT), a three-level protocol-structured model family that treats native protocol structures as compression units. PTT-Full learns protocol-structured representations and field salience from complete Protocol Tree Graphs (PTGs), with flow-level self-supervised learning and protocol-presence-aware sparse execution. The learned salience and TopK+$k$ closure construct Distilled PTGs (PTG-Ds) for PTT-Distilled, while PTT-Lite inherits this topology and reduces width through structure-aligned transfer and flow-level logits distillation. Under flow-disjoint and Strong Information Information (SII)-masked settings, PTT-Full achieves Macro-F1 scores of 0.9519 and 0.9416 on CSTNET-TLS1.3 and CipherSpectrum, while PTT-Lite retains 0.9325 and 0.9136 with 80.3\% and 61.3\% fewer parameters, 98.85\% and 98.78\% lower effective GFLOPs, and 8.75$\times$ and 8.46$\times$ CPU inference speedups. These results demonstrate that treating protocol structure itself as the compression object enables effective performance-efficiency trade-offs for lightweight ETC.

Related papers

• Mixtures of Subspaces for Bandwidth Efficient Context Parallel Training [54.43685601795611]
  We propose a compression method for communication-efficient context parallelism in decentralized settings.<n>Our key insight is to exploit the intrinsic low-rank structure of activation outputs by dynamically constraining them to learned mixtures of subspaces.
  arXiv  Detail & Related papers  (2026-06-15T08:17:13Z)
• TraceCodec: A Compiler-Backed Neural Codec for Stateful Multi-Flow Network Traffic Traces [10.977191979493968]
  Critical networking legality require high-fidelity packet captures (PCAPs) for testing, security analysis, and protocol validation.<n>Recent packet generators have demonstrated protocol-constrained PCAP synthesis, but they universally decode directly to raw packet fields.<n>We present TraceCodec, a state-aware neural for stateful multi-flow traces.
  arXiv  Detail & Related papers  (2026-05-28T13:52:40Z)
• Physics-Informed Causal MDPs for Sequential Constraint Repair in Engineering Simulation Pipelines [0.0]
  We introduce PI-CMDP, a framework for CMDPs whose constraint dependencies form a layered DAG.<n>We instantiate PI-CMDP on constraint repair in engineering simulation pipelines.
  arXiv  Detail & Related papers  (2026-04-20T07:40:15Z)
• Reliable Hierarchical Operating System Fingerprinting via Conformal Prediction [62.40452053128524]
  Conformal Prediction (CP) could be wrapped around existing methods to obtain prediction sets with guaranteed coverage.<n>This work addresses these limitations by introducing and evaluating two distinct structured CP strategies.<n>While both methods satisfy validity guarantees, they expose a fundamental trade-off between level-wise efficiency and structural consistency.
  arXiv  Detail & Related papers  (2026-02-13T11:20:48Z)
• PACC: Protocol-Aware Cross-Layer Compression for Compact Network Traffic Representation [10.787806670196938]
  PACC is a redundancy-aware, layer-aware representation framework.<n>It consistently outperforms feature-engineered and raw-bit baselines.<n>It improves end-to-end efficiency by up to 3.16x.
  arXiv  Detail & Related papers  (2026-02-09T07:09:31Z)
• Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF [11.846509777720415]
  Multiparty private set intersection (MPSI) allows multiple participants to compute the intersection of their locally owned data sets without revealing them.<n>Most existing MPSI protocols are based on the star, mesh, and ring topologies.<n>We develop an MPSI protocol with a ring topology, addressing the challenges of communication and computational overhead.
  arXiv  Detail & Related papers  (2025-05-31T13:50:40Z)
• Efficient Token Compression for Vision Transformer with Spatial Information Preserved [59.79302182800274]
  Token compression is essential for reducing the computational and memory requirements of transformer models.<n>We propose an efficient and hardware-compatible token compression method called Prune and Merge.
  arXiv  Detail & Related papers  (2025-03-30T14:23:18Z)
• Contiguous Zero-Copy for Encrypted Transport Protocols [0.65268245109828]
  We call the methodology "Reverso" from reversing the order of field elements within a protocol specification.<n>We show how such a benign-looking change may unlock implementation optimizations for encrypted protocols during data transport.
  arXiv  Detail & Related papers  (2024-09-11T09:37:29Z)
• Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity [92.1840862558718]
  We introduce MARINA-P, a novel method for downlink compression, employing a collection of correlated compressors. We show that MARINA-P with permutation compressors can achieve a server-to-worker communication complexity improving with the number of workers. We introduce M3, a method combining MARINA-P with uplink compression and a momentum step, achieving bidirectional compression with provable improvements in total communication complexity as the number of workers increases.
  arXiv  Detail & Related papers  (2024-02-09T13:58:33Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Sparse Tensor-based Multiscale Representation for Point Cloud Geometry Compression [18.24902526033056]
  We develop a unified Point Cloud Geometry (PCG) compression method through Sparse Processing (STP) based multiscale representation of voxelized PCG. Applying the complexity reduces the complexity significantly because it only performs the convolutions centered at Most-Probable Positively-Occupied Voxels (MP-POV) The proposed method presents lightweight complexity due to point-wise, and tiny storage desire because of model sharing across all scales.
  arXiv  Detail & Related papers  (2021-11-20T17:02:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.