mlsanityData to 7 Oct 2026

Lens: A Knowledge-Guided Foundation Model for Network Traffic

arXiv 2402.03646 ↗First posted 6 Feb 2024cs.LG cs.NIcited by 7

Not on the map. Why?

Abstract (arXiv)

Network traffic refers to the amount of data being sent and received over the Internet or any system that connects computers. Analyzing network traffic is vital for security and management, yet remains challenging due to the heterogeneity of plain-text packet headers and encrypted payloads. To capture the latent semantics of traffic, recent studies have adopted Transformer-based pretraining techniques to learn network representations from massive traffic data. However, these methods pre-train on data-driven tasks but overlook network knowledge, such as masking partial digits of the indivisible network port numbers for prediction, thereby limiting semantic understanding. In addition, they struggle to extend classification to new classes during fine-tuning due to the distribution shift. Motivated by these limitations, we propose Lens, a unified knowledge-guided foundation model for both network traffic classification and generation. In pretraining, we propose a Knowledge-Guided Mask Span Prediction method with textual context for learning knowledge-enriched representations. For extending to new classes in finetuning, we reframe the traffic classification as a closed-ended generation task and introduce context-aware finetuning to adapt to the distribution shift. Evaluation results across various benchmark datasets demonstrate that the proposed Lens~achieves superior performance on both classification and generation tasks. For traffic classification, Lens~outperforms competitive baselines substantially on 8 out of 12 tasks with an average accuracy of 96.33% and extends to novel classes with significantly better performance. For traffic generation, Lens~generates better high-fidelity network traffic for network simulation, gaining up to 30.46% and 33.3% better accuracy and F1 in fuzzing tests. We will open-source the code upon publication.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 54 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

18 of 54 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  4. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  5. 2016Learning without Forgettingcited by 2,465
  6. 2021CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generationcited by 890
  7. 2020Autoregressive Entity Retrievalcited by 333
  8. 2019Neural Machine Translation with Byte-Level Subwordscited by 115
  9. 2017Deep Packet: A Novel Approach For Encrypted Traffic Classification Using Deep Learningcited by 69
  10. 2022ET-BERT: A Contextualized Datagram Representation with Pre-training Transformers for Encrypted Traffic Classificationcited by 66
  11. 2018Deep Fingerprinting: Undermining Website Fingerprinting Defenses with Deep Learningcited by 43
  12. 2023NetGPT: Generative Pretrained Transformer for Network Trafficcited by 31
6 more
  1. 2023NetDiffusion: Network Data Augmentation Through Protocol-Constrained Traffic Generationcited by 27
  2. 2018Flow-based Network Traffic Generation using Generative Adversarial Networkscited by 26
  3. 2023netFound: Principled Design for Network Foundation Modelscited by 17
  4. 2017Robust Smartphone App Identification Via Encrypted Network Traffic Analysiscited by 16
  5. 2017k-Nearest Neighbor Augmented Neural Networks for Text Classificationcited by 4
  6. 2021Synthetic flow-based cryptomining attack generation through Generative Adversarial Networkscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 3; 2026: 1.

7 papers.