Yao Xin
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
Yao Xin has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Wenjun Li
Pengcheng Laboratory, Shenzhen, China
6 shared publications - Lingfeng Qu
Guangzhou University
5 shared publications - Weizhe Zhang
Harbin Institute of Technology
4 shared publications - Yang Xu
Fudan University, Shanghai, China
4 shared publications - Chongwu Dong
Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, China
3 shared publications Yi Wang
Southern University of Science and Technology, Shenzhen, China
3 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 461-474
FlowTurbo: From Best-Effort to Hit-Driven MegaFlow Hardware Offloading in Open vSwitch
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 461-474
Open AccessFlowTurbo: From Best-Effort to Hit-Driven MegaFlow Hardware Offloading in Open vSwitch
- 16 June 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 202
GNS-GAN: A novel GAN model based on gradient noise suppression
- 16 June 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 202
GNS-GAN: A novel GAN model based on gradient noise suppression
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7880-7898
T2Tree: A Deterministic Algorithmic Framework for High-Speed Packet Classification
Packet classification in high-speed networks requires hardware acceleration for line-rate processing, yet existing decision tree algorithms struggle to effectively harness hardware parallelism. This paper presents T2Tree, a hardware-centric algorithm that strategically distributes wildcard-heavy rules across tree nodes to maximize parallel processing. T2Tree's key innovation lies in its hardware-aware rule distribution: by embedding wildcard-heavy rules throughout the hierarchy, it enables concurrent matching during traversal, potentially hiding latency within pipeline stages and achieving minimal overhead. The elimination of rule replication while maintaining full coverage allows T2Tree to dramatically reduce the number of decision trees required, making complete rule set implementation feasible within constrained on-chip resources. The algorithm features a unified framework that adapts to diverse rule sets without reconfiguration, a critical advantage for programmable hardware. Experimental results demonstrate significant improvements in throughput and memory efficiency compared to state-of-the-art approaches, while maintaining robust update performance. This hardware-software co-design is particularly suitable for FPGA-based accelerators and packet processing engines where deterministic latency, resource efficiency, and predictable memory usage are paramount.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7880-7898
T2Tree: A Deterministic Algorithmic Framework for High-Speed Packet Classification
Packet classification in high-speed networks requires hardware acceleration for line-rate processing, yet existing decision tree algorithms struggle to effectively harness hardware parallelism. This paper presents T2Tree, a hardware-centric algorithm that strategically distributes wildcard-heavy rules across tree nodes to maximize parallel processing. T2Tree's key innovation lies in its hardware-aware rule distribution: by embedding wildcard-heavy rules throughout the hierarchy, it enables concurrent matching during traversal, potentially hiding latency within pipeline stages and achieving minimal overhead. The elimination of rule replication while maintaining full coverage allows T2Tree to dramatically reduce the number of decision trees required, making complete rule set implementation feasible within constrained on-chip resources. The algorithm features a unified framework that adapts to diverse rule sets without reconfiguration, a critical advantage for programmable hardware. Experimental results demonstrate significant improvements in throughput and memory efficiency compared to state-of-the-art approaches, while maintaining robust update performance. This hardware-software co-design is particularly suitable for FPGA-based accelerators and packet processing engines where deterministic latency, resource efficiency, and predictable memory usage are paramount.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP  (00189545) , 1-16
ReToCue: Reliability-Aware Task Offloading and Caching in UAV-assisted LEO Satellite Edge Computing
The integration of Space-Air-Ground Networks with mobile edge computing represents a key 6G paradigm enabled by advances in low Earth orbit (LEO) satellites, unmanned aerial vehicles (UAVs), and terrestrial networks. However, several critical challenges emerge when handling delay-sensitive services in rescue missions and infrastructure-less scenarios, where terrestrial network layers are absent. In such scenarios, the limited battery capacity of UAVs and satellites can be exhausted quickly. These factors jointly increase the probability of task delay violations and degrade the quality of service. To address these challenges, our work first investigates the joint optimization of edge caching and computation offloading in the UAV-assisted LEO Satellite edge computing (UAV-LEC) system. The primary objective in our formulation is to minimize total energy consumption while maintaining strict service reliability requirements. Given the distributed and stochastic characteristics of the UAVLEC system, we utilize a partially observable Markov decision process (POMDP) to model the system. Furthermore, martingale theory is incorporated to analyze the service reliability bounds of the tandem queue in the proposed framework. Building on these theoretical foundations, we propose a novel asynchronous interactive multi-agent reinforcement learning algorithm to address the distributed caching and computation optimization problem in the UAV-LEC system. Finally, we conduct comprehensive simulations to demonstrate that the proposed algorithm achieves significant improvements compared to the baseline.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP  (00189545) , 1-16
ReToCue: Reliability-Aware Task Offloading and Caching in UAV-assisted LEO Satellite Edge Computing
The integration of Space-Air-Ground Networks with mobile edge computing represents a key 6G paradigm enabled by advances in low Earth orbit (LEO) satellites, unmanned aerial vehicles (UAVs), and terrestrial networks. However, several critical challenges emerge when handling delay-sensitive services in rescue missions and infrastructure-less scenarios, where terrestrial network layers are absent. In such scenarios, the limited battery capacity of UAVs and satellites can be exhausted quickly. These factors jointly increase the probability of task delay violations and degrade the quality of service. To address these challenges, our work first investigates the joint optimization of edge caching and computation offloading in the UAV-assisted LEO Satellite edge computing (UAV-LEC) system. The primary objective in our formulation is to minimize total energy consumption while maintaining strict service reliability requirements. Given the distributed and stochastic characteristics of the UAVLEC system, we utilize a partially observable Markov decision process (POMDP) to model the system. Furthermore, martingale theory is incorporated to analyze the service reliability bounds of the tandem queue in the proposed framework. Building on these theoretical foundations, we propose a novel asynchronous interactive multi-agent reinforcement learning algorithm to address the distributed caching and computation optimization problem in the UAV-LEC system. Finally, we conduct comprehensive simulations to demonstrate that the proposed algorithm achieves significant improvements compared to the baseline.
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 288-299
MegaTurbo: A Scalable FPGA-based Engine for MegaFlow Classifier in Open vSwitch
Open vSwitch (OVS) is a key component in cloud and data center networks, yet its MegaFlow classifier imposes significant CPU overhead. Existing SmartNIC-based acceleration approaches for the MegaFlow classifier typically employ simplistic hardware offloading techniques, which exhibit limited scalability for dynamic, large-scale flow tables. Motivated by these challenges, we argue that a hardware accelerator specifically tailored for the MegaFlow classifier is necessary, forming the basis of our FPGA-based solution, MegaTurbo. The core innovations of MegaTurbo are threefold: (1) a scalable and hardware-friendly decision-tree based packet classification algorithm, specifically optimized for the structure of MegaFlow rules; (2) a novel hardware architecture incorporating multiple pipelined matching engines, designed to process multiple decision trees generated by the software algorithm in parallel; and (3) a heterogeneous framework composed of CPU and FPGA, which can work together to support online rule updates, with little and bounded impact on rule searching. Experimental results on a Xilinx Virtex UltraScale+ FPGA demonstrate that MegaTurbo achieves a sustained classification throughput of 500 MPPS while supporting dynamic rule updates at 300-500 KUPS on 100K-scale rulesets. These results not only validate the effectiveness of our domain-specific co-design approach, but also highlight the potential of FPGA-based SmartNICs to address the performance bottlenecks of software switches in large-scale cloud and data center networks.
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 288-299
Open AccessMegaTurbo: A Scalable FPGA-based Engine for MegaFlow Classifier in Open vSwitch
Open vSwitch (OVS) is a key component in cloud and data center networks, yet its MegaFlow classifier imposes significant CPU overhead. Existing SmartNIC-based acceleration approaches for the MegaFlow classifier typically employ simplistic hardware offloading techniques, which exhibit limited scalability for dynamic, large-scale flow tables. Motivated by these challenges, we argue that a hardware accelerator specifically tailored for the MegaFlow classifier is necessary, forming the basis of our FPGA-based solution, MegaTurbo. The core innovations of MegaTurbo are threefold: (1) a scalable and hardware-friendly decision-tree based packet classification algorithm, specifically optimized for the structure of MegaFlow rules; (2) a novel hardware architecture incorporating multiple pipelined matching engines, designed to process multiple decision trees generated by the software algorithm in parallel; and (3) a heterogeneous framework composed of CPU and FPGA, which can work together to support online rule updates, with little and bounded impact on rule searching. Experimental results on a Xilinx Virtex UltraScale+ FPGA demonstrate that MegaTurbo achieves a sustained classification throughput of 500 MPPS while supporting dynamic rule updates at 300-500 KUPS on 100K-scale rulesets. These results not only validate the effectiveness of our domain-specific co-design approach, but also highlight the potential of FPGA-based SmartNICs to address the performance bottlenecks of software switches in large-scale cloud and data center networks.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7858-7873
HBT: A Hybrid Bidding Tree for High-Performance Packet Classification
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7858-7873
HBT: A Hybrid Bidding Tree for High-Performance Packet Classification
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13  (17) , 1
Welford-Sketch: Finding Steady Heavy Flows in Data Streams
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13  (17) , 1
Welford-Sketch: Finding Steady Heavy Flows in Data Streams
- Open Access
- 30 December 2025
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38  (2)
Ciphertext-domain fragile watermarking using hamming codes for dual-stage tamper detection and recovery
- 30 December 2025
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38  (2)
Open AccessCiphertext-domain fragile watermarking using hamming codes for dual-stage tamper detection and recovery
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34  (1) , 219-230
A Multimechanism Fuzzy Logic Control Scheme for Autonomous Vehicle System Security: Machine Learning-Supervised Data Compression With Integrated Performance Estimation
This paper investigates the resilience of autonomous vehicle (AV) systems against denial-of-service (DoS) attacks in networked environments. While existing fuzzy logic and event-triggered control strategies have been explored, they often fail to address the combined impacts of DoS-induced network congestion, data compression errors, and the lack of real-time adaptive learning to maintain stability. To address this gap, this work introduces a unified, resilient fuzzy logic control framework. First, a Performance Error Estimation (PEE) framework is developed to quantify control performance degradation under cyber threats, informing the design of the resilient controller. Second, an efficient data compression scheme is designed to mitigate DoS-induced network overload, ensuring reliable real-time data transmission under constrained bandwidth. Third, an Intelligent Event-Triggered Fuzzy Controller (IETFC) is proposed, which adaptively optimizes its triggering threshold via a mini-batch machine learning algorithm, effectively balancing communication efficiency with system robustness. Validation on the CarSim–Simulink platform demonstrates that the proposed framework successfully mitigates DoS-induced performance degradation, enhances triggering sparsity, and improves computational efficiency. By embedding learning-based adaptation into fuzzy control, this work provides a scalable and secure solution for AV systems operating under adversarial conditions.
- 4 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34  (1) , 219-230
A Multimechanism Fuzzy Logic Control Scheme for Autonomous Vehicle System Security: Machine Learning-Supervised Data Compression With Integrated Performance Estimation
This paper investigates the resilience of autonomous vehicle (AV) systems against denial-of-service (DoS) attacks in networked environments. While existing fuzzy logic and event-triggered control strategies have been explored, they often fail to address the combined impacts of DoS-induced network congestion, data compression errors, and the lack of real-time adaptive learning to maintain stability. To address this gap, this work introduces a unified, resilient fuzzy logic control framework. First, a Performance Error Estimation (PEE) framework is developed to quantify control performance degradation under cyber threats, informing the design of the resilient controller. Second, an efficient data compression scheme is designed to mitigate DoS-induced network overload, ensuring reliable real-time data transmission under constrained bandwidth. Third, an Intelligent Event-Triggered Fuzzy Controller (IETFC) is proposed, which adaptively optimizes its triggering threshold via a mini-batch machine learning algorithm, effectively balancing communication efficiency with system robustness. Validation on the CarSim–Simulink platform demonstrates that the proposed framework successfully mitigates DoS-induced performance degradation, enhances triggering sparsity, and improves computational efficiency. By embedding learning-based adaptation into fuzzy control, this work provides a scalable and secure solution for AV systems operating under adversarial conditions.
- 24 May 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68  (10) , 1565-1578
REFS: a novel framework for accelerated receive encrypted flow steering
In virtual private network (VPN) tunnel mode, the entire original packet, including the header’s five-tuple information, is encrypted, which prevents traditional scheduling algorithms from evenly distributing packets to central processing unit (CPU) cores based on packet header information. To address the need for data security and encrypted packet scheduling, we propose a novel framework, named REFS (receive encrypted flow steering), for accelerated receive encrypted flow steering. This work creatively adopts a new method that allows encrypted packets to be distributed across CPU cores without decrypting them, overcoming limitations of traditional scheduling approaches. It efficiently distributes encrypted packets across CPU cores, enabling dynamic allocation of CPU resources. A key feature of REFS is its ability to perform this distribution without decrypting the packets, which enhances dynamic load balancing and improves system responsiveness. When integrated into the Linux kernel’s VPN functionality, REFS can potentially increase throughput by up to 50% compared to WireGuard, which is a benchmark for kernel-based VPN performance. Upon integration of REFS into userspace, network performance shows significant improvements: throughput doubles, while latency is reduced by 80%.
- 24 May 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68  (10) , 1565-1578
REFS: a novel framework for accelerated receive encrypted flow steering
In virtual private network (VPN) tunnel mode, the entire original packet, including the header’s five-tuple information, is encrypted, which prevents traditional scheduling algorithms from evenly distributing packets to central processing unit (CPU) cores based on packet header information. To address the need for data security and encrypted packet scheduling, we propose a novel framework, named REFS (receive encrypted flow steering), for accelerated receive encrypted flow steering. This work creatively adopts a new method that allows encrypted packets to be distributed across CPU cores without decrypting them, overcoming limitations of traditional scheduling approaches. It efficiently distributes encrypted packets across CPU cores, enabling dynamic allocation of CPU resources. A key feature of REFS is its ability to perform this distribution without decrypting the packets, which enhances dynamic load balancing and improves system responsiveness. When integrated into the Linux kernel’s VPN functionality, REFS can potentially increase throughput by up to 50% compared to WireGuard, which is a benchmark for kernel-based VPN performance. Upon integration of REFS into userspace, network performance shows significant improvements: throughput doubles, while latency is reduced by 80%.