Scholarlink

<p>Deep learning (DL) has shown significant promise in network traffic classification, outperforming traditional methods such as port-based, payload-based, and earlier machine learning approaches. However, the complexity of DL models hinders their deployment on resource-constrained edge devices. Current lightweight traffic classification focus on global pruning and eliminating fully connected layers. Despite their effectiveness, these methods overlook two crucial aspects: the potential of layer-wise pruning for further complexity reduction; and the possibility of lowering computation precision. This paper proposes an approach that combines layer-wise pruning with quantization, utilizing reinforcement learning to efficiently explore the large design space for joint pruning-quantization. Our evaluations on the ISCX2016VPN, USTC-TFC2016, and ITC-NET-AUDIO-5 datasets demonstrate that the proposed method reduces computational complexity up to 8 times and parameter count by 3 times compared to existing methods, while maintaining acceptable accuracy levels. Overall, our proposed method classifies a single raw packet in 107 microseconds and requires only 24 kB of storage without buffering circuitry. This demonstrates its effectiveness in achieving high performance and efficiency for edge-based network traffic classification. The code is open-sourced at <a href="https://github.com/zafriazman/PruneQuant-TrafClassif">https://github.com/zafriazman/PruneQuant-TrafClassif</a>.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Bufferless network traffic classification using reinforcement learning-based joint pruning-quantization

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年12月6日

查看全文
  • Muhammad Nor Azzafri Nor-Azman,
  • Usman Ullah Sheikh,
  • Mohammed Sultan Mohammed,
  • Jeevan Sirkunan,
  • Muhammad Nadzir Marsono

摘要

Deep learning (DL) has shown significant promise in network traffic classification, outperforming traditional methods such as port-based, payload-based, and earlier machine learning approaches. However, the complexity of DL models hinders their deployment on resource-constrained edge devices. Current lightweight traffic classification focus on global pruning and eliminating fully connected layers. Despite their effectiveness, these methods overlook two crucial aspects: the potential of layer-wise pruning for further complexity reduction; and the possibility of lowering computation precision. This paper proposes an approach that combines layer-wise pruning with quantization, utilizing reinforcement learning to efficiently explore the large design space for joint pruning-quantization. Our evaluations on the ISCX2016VPN, USTC-TFC2016, and ITC-NET-AUDIO-5 datasets demonstrate that the proposed method reduces computational complexity up to 8 times and parameter count by 3 times compared to existing methods, while maintaining acceptable accuracy levels. Overall, our proposed method classifies a single raw packet in 107 microseconds and requires only 24 kB of storage without buffering circuitry. This demonstrates its effectiveness in achieving high performance and efficiency for edge-based network traffic classification. The code is open-sourced at https://github.com/zafriazman/PruneQuant-TrafClassif.