Skip to content

Author

Yuhui Deng

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

2026

Automatic Model Compression and Quantized Deployment of Convolutional Neural Networks on Programmable Data Planes

The rapid development of programmable network devices and the widespread adoption of machine learning (ML) in networking have facilitated efficient research into intelligent data planes (IDPs). Offloading ML to programmable data planes (PDPs) enables quick analysis and responses to network traffic dynamics, and efficient management of network links. Compared to using an external low-cost board with sufficient memory and a general-purpose CPU, IDP deployment keeps inference inside the switch forwarding pipeline, avoiding inter-device transfer and coordination overhead. This enables line-rate processing and faster response for real-time network control. However, the hardware pipeline presents significant resource limitations. For instance, Intel Tofino ASIC has only 10Mb SRAM in each stage, and lacks support for multiplication, division, and floating-point operations. These constraints significantly hinder the development of IDP. This paper presents Quark, a framework that automatically compresses the convolutional neural network (CNN) and fully offloads quantized inference onto PDP. Quark employs model pruning to simplify the CNN model, uses quantization to support floating-point operations, and utilizes neural architecture search to balance accuracy and PDP resource constraints. Additionally, Quark divides the CNN into smaller units to improve resource utilization on the PDP. We have implemented a testbed prototype of Quark on both P4 hardware switch (Intel Tofino ASIC) and software switch (i.e., BMv2). Extensive evaluation results on the ISCX Botnet dataset demonstrate that Quark achieves 97.3% accuracy while using only 24.27% of the SRAM resources on the Intel Tofino ASIC switch, completing inference tasks at line rate with an average latency of $42.66\mu s$ .

Xiaoquan Zhang, Mai Zhang, Lin Cui et al. · 0 citations
2026

Latency-Sensitive and Resource-Efficient Parallel VNF Placement in Mobile Edge Networks: A Dynamic Graph Weighting Approach

Mobile edge networks delivers low-latency, high-quality services by deploying Virtual Network Functions (VNFs) on resource-constrained edge nodes. However, sequential VNF processing incurs significant latency, while reusing existing VNFs under heavy demand may force requests onto longer paths, increasing bandwidth consumption. Parallelization combined with efficient VNF placement is therefore essential, yet these decisions are inherently coupled and may lead to suboptimal deployments if optimized separately. To address this challenge, this paper proposes a unified framework that jointly optimizes VNF parallelization and placement to minimize latency and resource consumption. The framework constructs a Dependency-Deployment Graph (DPG) that integrates VNF functional dependencies with Mobile Edge Networks topology. By assigning latency and resource weights to DPG nodes and edges, the framework captures the interplay between transmission delay, resource usage, parallelization, and deployment decisions. To efficiently explore the solution space, iterative algorithms progressively refine candidate configurations by pruning inferior solutions and focusing on promising regions of the search space. Experimental evaluations across diverse network configurations demonstrate that the proposed framework achieves promising improvements in reducing service latency and resource consumption compared with representative baseline methods. The results further indicate the effectiveness and robustness of the proposed joint parallelization and placement strategy under the tested heterogeneous edge computing scenarios.

Yuhao Xie, Zhen Zhang, Yuhui Deng et al. · 0 citations