Zhikang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhikang Chen has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Haoyu Song
Futurewei Technologies, San Jose, CA, USA
5 shared publications - Bin Liu
Tsinghua University, Beijing, China
4 shared publications - Yong Feng
Tsinghua University, Beijing, China
3 shared publications - Hanyi Zhou
Tsinghua University, Beijing, China
2 shared publications - Shuxin Liu
Tsinghua University, Beijing, China
2 shared publications - Wenquan Xu
Tsinghua University, Beijing, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5985-5998
LAPS: Latency Aware Packet Spraying on Unequal-Cost Multi-Path Data Center Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5985-5998
LAPS: Latency Aware Packet Spraying on Unequal-Cost Multi-Path Data Center Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 1-8
Learning-based Acoustic Field Focal Point Control for Mid-Air Haptic Rendering
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (9) , 1-8
Learning-based Acoustic Field Focal Point Control for Mid-Air Haptic Rendering
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-18
LAPS: Joint Load Balancing and Congestion Control on Unequal-cost Multi-path Data Center Networks
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-18
Open AccessLAPS: Joint Load Balancing and Congestion Control on Unequal-cost Multi-path Data Center Networks
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 897-912
Enhancing Stateful Processing in Programmable Data Planes: Model and Improved Architecture
Stateful data plane network applications are indispensable but their efficiency is hindered by prevalent network device architectures which utilize a Blocking Scheme to maintain state consistency. The Blocking Scheme results in poor throughput and latency performance due to its frequent halts during packet processing. In response to this issue, we propose an innovative Non-Blocking Scheme and construct a theoretical model based on the G/GI/m queueing model. The new scheme leverages the speculative execution method, avoiding unnecessary blocking by taking advantage of the fact that the state update ratio is usually much smaller than the incoming packet rate. In case of speculation failures, the affected packets are reprocessed to guarantee state consistency. We provide an approximate model for the Blocking Scheme, and show that, even with relaxed approximations, the Blocking Scheme still performs worse than the Non-Blocking Scheme. The superior performance of the Non-Blocking Scheme is further corroborated through rigorous simulations, conducted under both realistic and synthetic traces. Based on our model, we propose an enhanced architecture: SN_RAPID (Sequence Number and unidirectional Reverse path-Augmented PIpeline Dataplane), to support speculative execution. The architecture is simpler than the other architectures supporting stateful network functions. Serving as a design foundation for future iterations, we implement a prototype of SN_RAPID in FPGA which can run at line speed, and also develop a software ASIC emulator. The experiments show the superiority of the improved architecture.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 897-912
Enhancing Stateful Processing in Programmable Data Planes: Model and Improved Architecture
Stateful data plane network applications are indispensable but their efficiency is hindered by prevalent network device architectures which utilize a Blocking Scheme to maintain state consistency. The Blocking Scheme results in poor throughput and latency performance due to its frequent halts during packet processing. In response to this issue, we propose an innovative Non-Blocking Scheme and construct a theoretical model based on the G/GI/m queueing model. The new scheme leverages the speculative execution method, avoiding unnecessary blocking by taking advantage of the fact that the state update ratio is usually much smaller than the incoming packet rate. In case of speculation failures, the affected packets are reprocessed to guarantee state consistency. We provide an approximate model for the Blocking Scheme, and show that, even with relaxed approximations, the Blocking Scheme still performs worse than the Non-Blocking Scheme. The superior performance of the Non-Blocking Scheme is further corroborated through rigorous simulations, conducted under both realistic and synthetic traces. Based on our model, we propose an enhanced architecture: SN_RAPID (Sequence Number and unidirectional Reverse path-Augmented PIpeline Dataplane), to support speculative execution. The architecture is simpler than the other architectures supporting stateful network functions. Serving as a design foundation for future iterations, we implement a prototype of SN_RAPID in FPGA which can run at line speed, and also develop a software ASIC emulator. The experiments show the superiority of the improved architecture.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 904-920
OptimusPrime: Unleash Dataplane Programmability through a Transformable Architecture
Network dataplane calls for better programmability. Current programmable network processing chips are based on either pipeline or multi-core Run-To-Completion (RTC) architecture with various trade-offs in flexibility, performance, and cost. The existing attempts to amalgamate the strengths of the two are stilted and inflexible. In this paper, we challenge the status quo by introducing a more fluid and organic programmable chip architecture, OptimusPrime, built from identical hardware blocks. Unlike the conventional static hybrid architecture, OptimusPrime allows each block to be transformed into either a pipeline stage processor or a multi-core RTC processor through software-defined configuration, enabling versatile data plane programming tailored to a wide range of applications (e.g., stateful packet processing and in-network computing). We integrate the C and P4 languages for application programming and develop algorithms to map a user program to the optimal distribution of pipeline stages and RTC cores. We demonstrate the viability of OptimusPrime through practical use cases such as in-network aggregation, in-network caching, and network function integration. We developed an FPGA-based prototype and a software-based ASIC simulator to validate the feasibility of OptimusPrime, which can be used by switches and smartNICs to enhance their programmability to a new level with high performance and low cost.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 904-920
Open AccessOptimusPrime: Unleash Dataplane Programmability through a Transformable Architecture
Network dataplane calls for better programmability. Current programmable network processing chips are based on either pipeline or multi-core Run-To-Completion (RTC) architecture with various trade-offs in flexibility, performance, and cost. The existing attempts to amalgamate the strengths of the two are stilted and inflexible. In this paper, we challenge the status quo by introducing a more fluid and organic programmable chip architecture, OptimusPrime, built from identical hardware blocks. Unlike the conventional static hybrid architecture, OptimusPrime allows each block to be transformed into either a pipeline stage processor or a multi-core RTC processor through software-defined configuration, enabling versatile data plane programming tailored to a wide range of applications (e.g., stateful packet processing and in-network computing). We integrate the C and P4 languages for application programming and develop algorithms to map a user program to the optimal distribution of pipeline stages and RTC cores. We demonstrate the viability of OptimusPrime through practical use cases such as in-network aggregation, in-network caching, and network function integration. We developed an FPGA-based prototype and a software-based ASIC simulator to validate the feasibility of OptimusPrime, which can be used by switches and smartNICs to enhance their programmability to a new level with high performance and low cost.
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 798-815
ClickINC: In-network Computing as a Service in Heterogeneous Programmable Data-center Networks
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 798-815
Open AccessClickINC: In-network Computing as a Service in Heterogeneous Programmable Data-center Networks
- Open Access
- 1 January 2023
- Published by Shanghai Institute of Organic Chemistry in Chinese Journal of Organic Chemistry
- Vol. 43 (10) , 3590-3597
Silylene/Organoaluminum Lewis Pair System and the Initiation Property for Polymerization of (Meth)acrylates
- 1 January 2023
- Published by Shanghai Institute of Organic Chemistry in Chinese Journal of Organic Chemistry
- Vol. 43 (10) , 3590-3597
Open AccessSilylene/Organoaluminum Lewis Pair System and the Initiation Property for Polymerization of (Meth)acrylates
- Open Access
- 1 March 2022
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2228 (1) , 012045
Research on Flush Air Data Sensing System Based on Kriging Model
Compared with traditional air data senening system, flush air data sensing (FADS) system is more accurate, more reliable, and can be used in invisible environment. Algorithm research on FADS was conducted using Kriging model with good real-time and high accuracy. The aerodynamic model of FADS was established while Kriging algorithm was used to calculate flight data with optimized parameter. Mach number, angle of attack, and the aircraft were calculated with simulation and wind tunnel experimental data based on Kriging algorithm. Compared with the neural network algorithm, the inverse distance weight interpolation algorithm, and the SVR fitting algorithm, the results show that the optimized Kriging algorithm performs better.
- 1 March 2022
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2228 (1) , 012045
Open AccessResearch on Flush Air Data Sensing System Based on Kriging Model
Compared with traditional air data senening system, flush air data sensing (FADS) system is more accurate, more reliable, and can be used in invisible environment. Algorithm research on FADS was conducted using Kriging model with good real-time and high accuracy. The aerodynamic model of FADS was established while Kriging algorithm was used to calculate flight data with optimized parameter. Mach number, angle of attack, and the aircraft were calculated with simulation and wind tunnel experimental data based on Kriging algorithm. Compared with the neural network algorithm, the inverse distance weight interpolation algorithm, and the SVR fitting algorithm, the results show that the optimized Kriging algorithm performs better.
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 783-786
Research on an Improved CNN Speech Recognition System Based on Hidden Markov Model
In order to improve the accuracy of speech recognition and speaker identification in the field of production and life, an improved convolutional neural network algorithm based on hidden markov model is proposed, which includes four parts: feature extraction, segmentation, training and clustering. Quantization and clustering were carried out in the recorded sound set, the feature vectors of the obtained sound signal were segmented, and further training was conducted by deep convolutional network. Finally, after the state segmentation of HMM was completed, the recognition was completed by CNN as the input part of CNN. The experimental results show that the improved CNN based on hidden markov model can complete the recognition function and verify the correctness of the algorithm.
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 783-786
Research on an Improved CNN Speech Recognition System Based on Hidden Markov Model
In order to improve the accuracy of speech recognition and speaker identification in the field of production and life, an improved convolutional neural network algorithm based on hidden markov model is proposed, which includes four parts: feature extraction, segmentation, training and clustering. Quantization and clustering were carried out in the recorded sound set, the feature vectors of the obtained sound signal were segmented, and further training was conducted by deep convolutional network. Finally, after the state segmentation of HMM was completed, the recognition was completed by CNN as the input part of CNN. The experimental results show that the improved CNN based on hidden markov model can complete the recognition function and verify the correctness of the algorithm.