Xiaoli Wang
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
Research Subjects
Xiaoli Wang has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
Yuping Wang
7 shared publications- Bharadwaj Veeravalli
Department of Electrical and Computer Engineering National University of Singapore 4 Engineering Drive 3 Singapore
5 shared publications - Yuping Wang
School of Computer Science and Technology Xidian University Xi'an 710071 China
5 shared publications - Miao Ye
School of Information and Communication, Guilin University of Electronic Technology, Guilin, China
3 shared publications - Xiaobo Song
The 20th Research Institute of China Electronics Technology Group Corporation, Xi’an 710068, China
3 shared publications - Yong Wang
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China
3 shared publications
Latest Publications
- 2 June 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 125
Implicit Augmentation Contrastive Learning for long-tailed medical image classification
- 2 June 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 125
Implicit Augmentation Contrastive Learning for long-tailed medical image classification
- Open Access
- 1 April 2026
- Published by Elsevier in SSRN Electronic Journal
An Intelligent Anycast Routing Method Integrating Software-Defined Networking and Parallel Hierarchical Graph Reinforcement Learning
Anycast routing enables dynamic destination selection for data flows, improving failover and load balancing in applications such as domain name systems (DNS) and content delivery networks (CDNs). However, existing reinforcement learning (RL) approaches often rely on convolutional neural networks (CNNs) that are poorly matched to non-Euclidean network topologies, neglect the strong coupling between destination selection and path planning, and offer limited support for efficient online interaction. These limitations lead to high-dimensional action spaces, slow convergence, and substantial computation-induced decision latency. To address these challenges, we propose PHGRL-AR, a parallel hierarchical graph reinforcement learning-based anycast routing policy. First, we build an online interactive routing control framework under a software-defined networking (SDN) architecture to enable global dynamic state measurement and reduce computation-induced decision latency. Second, we employ hierarchical RL to decouple destination selection from path planning, thereby reducing action-space dimensionality. During path generation, we introduce an action-masking mechanism based on adjacency relations and shortest-path ordering to prevent invalid actions and routing loops, improving interaction efficiency. Third, to overcome CNN limitations, we incorporate graph RL and design an edge-node switching graph convolution structure. This design aligning with the joint node-link attribute characteristics of anycast routing to enhance generalization. Finally, we parallelize environment interactions during training to reduce computational overhead. Experimental results show that PHGRL-AR significantly reduces end-to-end delay compared with the shortest-shortest-path (SSP) algorithm and a hierarchical graph reinforcement learning baseline, achieving a maximum reduction of 50.3%.
- 1 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn Intelligent Anycast Routing Method Integrating Software-Defined Networking and Parallel Hierarchical Graph Reinforcement Learning
Anycast routing enables dynamic destination selection for data flows, improving failover and load balancing in applications such as domain name systems (DNS) and content delivery networks (CDNs). However, existing reinforcement learning (RL) approaches often rely on convolutional neural networks (CNNs) that are poorly matched to non-Euclidean network topologies, neglect the strong coupling between destination selection and path planning, and offer limited support for efficient online interaction. These limitations lead to high-dimensional action spaces, slow convergence, and substantial computation-induced decision latency. To address these challenges, we propose PHGRL-AR, a parallel hierarchical graph reinforcement learning-based anycast routing policy. First, we build an online interactive routing control framework under a software-defined networking (SDN) architecture to enable global dynamic state measurement and reduce computation-induced decision latency. Second, we employ hierarchical RL to decouple destination selection from path planning, thereby reducing action-space dimensionality. During path generation, we introduce an action-masking mechanism based on adjacency relations and shortest-path ordering to prevent invalid actions and routing loops, improving interaction efficiency. Third, to overcome CNN limitations, we incorporate graph RL and design an edge-node switching graph convolution structure. This design aligning with the joint node-link attribute characteristics of anycast routing to enhance generalization. Finally, we parallelize environment interactions during training to reduce computational overhead. Experimental results show that PHGRL-AR significantly reduces end-to-end delay compared with the shortest-shortest-path (SSP) algorithm and a hierarchical graph reinforcement learning baseline, achieving a maximum reduction of 50.3%.
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12990-13003
A Distributed Storage Routing Model and Algorithm for Resource Scarce and Abundant Network Slicing
In both resource-scarce and resource-abundant scenarios (i.e., in the scenarios where service demands exceed/do not exceed available resources), it is a critical challenge to design efficient task allocation model and algorithm in network slicing in 5G/Beyond 5G (B5G)/6G networks, especially in resource-scarce scenario. This challenge faces the following three difficult tasks: 1) fully utilize network resources, 2) satisfy all user requests, and 3) make the best trade-offs among service latency, service failure rate, and Mobile Network Operator (MNO) cost. To address this challenge, we propose a three objective optimization model, the Versatile Storage Routing (VSR) model. It facilitates collaborative multi-device sharing for a single Virtual Network Function (VNF) and parallel multi-path data transmission, thus enabling full utilization of the resources. Also, it can provide efficient resource allocation schemes in both resource-abundant and resource-scarce scenarios to satisfy all user requests. Furthermore, we design a novel evolutionary algorithm for VSR model called VSR-EA based on Non-dominated Sorting Genetic Algorithm II (NSGA II) framework. It features customized encoding/decoding and evolutionary operators to handle multi-device storage allocation, multi-path routing selection and distributed transmission resource allocation. As a result, the best trade-offs among service latency, service failure rate, and MNO cost can be obtained. Simulation results demonstrate that VSR-EA exhibits broader applicability and yields significantly superior solutions compared to benchmark algorithms.
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (8) , 12990-13003
A Distributed Storage Routing Model and Algorithm for Resource Scarce and Abundant Network Slicing
In both resource-scarce and resource-abundant scenarios (i.e., in the scenarios where service demands exceed/do not exceed available resources), it is a critical challenge to design efficient task allocation model and algorithm in network slicing in 5G/Beyond 5G (B5G)/6G networks, especially in resource-scarce scenario. This challenge faces the following three difficult tasks: 1) fully utilize network resources, 2) satisfy all user requests, and 3) make the best trade-offs among service latency, service failure rate, and Mobile Network Operator (MNO) cost. To address this challenge, we propose a three objective optimization model, the Versatile Storage Routing (VSR) model. It facilitates collaborative multi-device sharing for a single Virtual Network Function (VNF) and parallel multi-path data transmission, thus enabling full utilization of the resources. Also, it can provide efficient resource allocation schemes in both resource-abundant and resource-scarce scenarios to satisfy all user requests. Furthermore, we design a novel evolutionary algorithm for VSR model called VSR-EA based on Non-dominated Sorting Genetic Algorithm II (NSGA II) framework. It features customized encoding/decoding and evolutionary operators to handle multi-device storage allocation, multi-path routing selection and distributed transmission resource allocation. As a result, the best trade-offs among service latency, service failure rate, and MNO cost can be obtained. Simulation results demonstrate that VSR-EA exhibits broader applicability and yields significantly superior solutions compared to benchmark algorithms.
- Open Access
A New Spatiotemporal Correlation Anomaly Detection Method that Integrates Contrastive Learning and Few-Shot Learning in Wireless Sensor Networks
Detecting anomalies in the data collected by WSNs can provide crucial evidence for assessing the reliability and stability of WSNs. Existing methods for WSN anomaly detection often face challenges such as the limited extraction of spatiotemporal correlation features, the absence of sample labels, few anomaly samples, and an imbalanced sample distribution. To address these issues, a spatiotemporal correlation detection model (MTAD-RD) considering both model architecture and a two-stage training strategy perspective is proposed. In terms of model structure design, the proposed MTAD-RD backbone network includes a retentive network (RetNet) enhanced by a cross-retention (CR) module, a multigranular feature fusion module, and a graph attention network module to extract internode correlation information. This proposed model can integrate the intermodal correlation features and spatial features of WSN neighbor nodes while extracting global information from time series data. Moreover, its serialized inference characteristic can remarkably reduce inference overhead. For model training, a two-stage training approach was designed. First, a contrastive learning proxy task was designed for time series data with graph structure information in WSNs, enabling the backbone network to learn transferable features from unlabeled data using unsupervised contrastive learning methods, thereby addressing the issue of missing sample labels in the dataset. Then, a caching-based sample sampler was designed to divide samples into few-shot and contrastive learning data. A specific joint loss function was developed to jointly train the dual-graph discriminator network to address the problem of sample imbalance effectively. In experiments carried out on real public datasets, the designed MTAD-RD anomaly detection method achieved an F1 score of 90.97%, outperforming existing supervised WSN anomaly detection methods.
Open AccessA New Spatiotemporal Correlation Anomaly Detection Method that Integrates Contrastive Learning and Few-Shot Learning in Wireless Sensor Networks
Detecting anomalies in the data collected by WSNs can provide crucial evidence for assessing the reliability and stability of WSNs. Existing methods for WSN anomaly detection often face challenges such as the limited extraction of spatiotemporal correlation features, the absence of sample labels, few anomaly samples, and an imbalanced sample distribution. To address these issues, a spatiotemporal correlation detection model (MTAD-RD) considering both model architecture and a two-stage training strategy perspective is proposed. In terms of model structure design, the proposed MTAD-RD backbone network includes a retentive network (RetNet) enhanced by a cross-retention (CR) module, a multigranular feature fusion module, and a graph attention network module to extract internode correlation information. This proposed model can integrate the intermodal correlation features and spatial features of WSN neighbor nodes while extracting global information from time series data. Moreover, its serialized inference characteristic can remarkably reduce inference overhead. For model training, a two-stage training approach was designed. First, a contrastive learning proxy task was designed for time series data with graph structure information in WSNs, enabling the backbone network to learn transferable features from unlabeled data using unsupervised contrastive learning methods, thereby addressing the issue of missing sample labels in the dataset. Then, a caching-based sample sampler was designed to divide samples into few-shot and contrastive learning data. A specific joint loss function was developed to jointly train the dual-graph discriminator network to address the problem of sample imbalance effectively. In experiments carried out on real public datasets, the designed MTAD-RD anomaly detection method achieved an F1 score of 90.97%, outperforming existing supervised WSN anomaly detection methods.
- Open Access
- 2 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 145
Scheduling Model and Algorithm for Transportation and Vehicle Charging of Multiple Autonomous Electric Vehicles
Autonomous electric vehicle (AEV) services leverage advanced autonomous driving and electric vehicle technologies to provide innovative, driverless transportation solutions. The biggest challenge faced by AEVs is the limited number of charging stations and long charging times. A critical challenge is maximizing passenger travel satisfaction while reducing the AEV idle time. This involves coordinating passenger transport and charging tasks via leveraging the information from charging stations, passenger transport, and AEV data. There are four important contributions in this paper. Firstly, we introduce an integrated scheduling model that considers both passenger transport and charging tasks. Secondly, we propose a multi-level differentiated charging threshold strategy, which dynamically adjusts the charging threshold based on both AEV battery levels and the availability of charging stations, reducing competition among vehicles and minimizing waiting times. Thirdly, we develop a rapid strategy to optimize the selection of charging stations by combining geographic and deviation distance. Fourthly, we design a new evolutionary algorithm to solve the proposed model, in which a buffer space is introduced to promote diversity within the population. Finally, experimental results show that compared to the existing state-of-the-art scheduling algorithms, the proposed algorithm shortens the running time of scheduling algorithms by 6.72% and reduces the idle driving time of AEVs by 6.53%, which proves the effectiveness and efficiency of the proposed model and algorithm.
- 2 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 145
Open AccessScheduling Model and Algorithm for Transportation and Vehicle Charging of Multiple Autonomous Electric Vehicles
Autonomous electric vehicle (AEV) services leverage advanced autonomous driving and electric vehicle technologies to provide innovative, driverless transportation solutions. The biggest challenge faced by AEVs is the limited number of charging stations and long charging times. A critical challenge is maximizing passenger travel satisfaction while reducing the AEV idle time. This involves coordinating passenger transport and charging tasks via leveraging the information from charging stations, passenger transport, and AEV data. There are four important contributions in this paper. Firstly, we introduce an integrated scheduling model that considers both passenger transport and charging tasks. Secondly, we propose a multi-level differentiated charging threshold strategy, which dynamically adjusts the charging threshold based on both AEV battery levels and the availability of charging stations, reducing competition among vehicles and minimizing waiting times. Thirdly, we develop a rapid strategy to optimize the selection of charging stations by combining geographic and deviation distance. Fourthly, we design a new evolutionary algorithm to solve the proposed model, in which a buffer space is introduced to promote diversity within the population. Finally, experimental results show that compared to the existing state-of-the-art scheduling algorithms, the proposed algorithm shortens the running time of scheduling algorithms by 6.72% and reduces the idle driving time of AEVs by 6.53%, which proves the effectiveness and efficiency of the proposed model and algorithm.
- 15 November 2024
- Published by Springer Nature in Computing
- Vol. 107 (1) , 1-22
Mpbs:research on mini-batch partitioning algorithm based on self-organizing map network
- 15 November 2024
- Published by Springer Nature in Computing
- Vol. 107 (1) , 1-22
Mpbs:research on mini-batch partitioning algorithm based on self-organizing map network
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (5) , 5733-5755
DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN
The multicast routing problem in software-defined networking (SDN) is an NP-hard problem. The existing solution methods based on deep strength learning suffer from the problems of branch redundancy, an excessively large action space and slow convergence of the intelligent models. In this paper, an intelligent multicast routing algorithm based on deep hierarchical reinforcement learning is proposed to circumvent the aforementioned problems. First, the optimal multicast tree problem is decomposed into two subproblems: fork node selection and the construction of an optimal path from a fork node to a destination node. Second, a multichannel matrix is designed as the state space for the internal and external controllers of hierarchical reinforcement learning based on the global network-aware information characteristics of SDN. Then, different action spaces are designed for the upper and lower subproblems, four action selection policies are designed for constructing multicast paths, and different reward policies are designed at different levels. Finally, a series of experiments and their results show that the designed algorithm not only searches the multicast tree efficiently but also converges faster and without redundant branches, with better performance in terms of bandwidth, delay and packet loss rate than the current mainstream solution algorithms. The codes for DHRL-FNMR are open and available at https://github.com/GuetYe/DHRL-FNMR.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (5) , 5733-5755
DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN
The multicast routing problem in software-defined networking (SDN) is an NP-hard problem. The existing solution methods based on deep strength learning suffer from the problems of branch redundancy, an excessively large action space and slow convergence of the intelligent models. In this paper, an intelligent multicast routing algorithm based on deep hierarchical reinforcement learning is proposed to circumvent the aforementioned problems. First, the optimal multicast tree problem is decomposed into two subproblems: fork node selection and the construction of an optimal path from a fork node to a destination node. Second, a multichannel matrix is designed as the state space for the internal and external controllers of hierarchical reinforcement learning based on the global network-aware information characteristics of SDN. Then, different action spaces are designed for the upper and lower subproblems, four action selection policies are designed for constructing multicast paths, and different reward policies are designed at different levels. Finally, a series of experiments and their results show that the designed algorithm not only searches the multicast tree efficiently but also converges faster and without redundant branches, with better performance in terms of bandwidth, delay and packet loss rate than the current mainstream solution algorithms. The codes for DHRL-FNMR are open and available at https://github.com/GuetYe/DHRL-FNMR.
- Open Access
- 20 September 2023
- Published by Springer Nature in Research Square
A New Intelligent Cross-Domain Routing Method in SDN Based on a Proposed Multiagent Reinforcement Learning Algorithm
Message transmission and message synchronization for multicontroller interdomain routing in software-defined networking (SDN) have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain a global state information of the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed multiagent deep reinforcement learning. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve the awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput, reduce the network delay and the packet loss rate compared to the Dijkstra and OSPF routing methods.
- 20 September 2023
- Published by Springer Nature in Research Square
Open AccessA New Intelligent Cross-Domain Routing Method in SDN Based on a Proposed Multiagent Reinforcement Learning Algorithm
Message transmission and message synchronization for multicontroller interdomain routing in software-defined networking (SDN) have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain a global state information of the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed multiagent deep reinforcement learning. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve the awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput, reduce the network delay and the packet loss rate compared to the Dijkstra and OSPF routing methods.
- Open Access
- 6 April 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (7) , 1752
Extension of Divisible-Load Theory from Scheduling Fine-Grained to Coarse-Grained Divisible Workloads on Networked Computing Systems
The big data explosion has sparked a strong demand for high-performance data processing. Meanwhile, the rapid development of networked computing systems, coupled with the growth of Divisible-Load Theory (DLT) as an innovative technology with competent scheduling strategies, provides a practical way of conducting parallel processing with big data. Existing studies in the area of DLT usually consider the scheduling problem with regard to fine-grained divisible workloads. However, numerous big data loads nowadays can only be abstracted as coarse-grained workloads, such as large-scale image classification, context-dependent emotional analysis and so on. In view of this, this paper extends DLT from fine-grained to coarse-grained divisible loads by establishing a new multi-installment scheduling model. With this model, a subtle heuristic algorithm was proposed to find a feasible load partitioning scheme that minimizes the makespan of the entire workload. Simulation results show that the proposed algorithm is superior to the up-to-date multi-installment scheduling strategy in terms of achieving a shorter makespan of workloads when dealing with coarse-grained divisible loads.
- 6 April 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (7) , 1752
Open AccessExtension of Divisible-Load Theory from Scheduling Fine-Grained to Coarse-Grained Divisible Workloads on Networked Computing Systems
The big data explosion has sparked a strong demand for high-performance data processing. Meanwhile, the rapid development of networked computing systems, coupled with the growth of Divisible-Load Theory (DLT) as an innovative technology with competent scheduling strategies, provides a practical way of conducting parallel processing with big data. Existing studies in the area of DLT usually consider the scheduling problem with regard to fine-grained divisible workloads. However, numerous big data loads nowadays can only be abstracted as coarse-grained workloads, such as large-scale image classification, context-dependent emotional analysis and so on. In view of this, this paper extends DLT from fine-grained to coarse-grained divisible loads by establishing a new multi-installment scheduling model. With this model, a subtle heuristic algorithm was proposed to find a feasible load partitioning scheme that minimizes the makespan of the entire workload. Simulation results show that the proposed algorithm is superior to the up-to-date multi-installment scheduling strategy in terms of achieving a shorter makespan of workloads when dealing with coarse-grained divisible loads.
- Open Access
Maximizing Heterogeneous Server Utilization with Limited Availability Times for Divisible Loads Scheduling on Networked Systems
Most of the available divisible-load scheduling models assume that all servers in networked systems are idle before workloads arrive and that they can remain available online during workload computation. In fact, this assumption is not always valid. Different servers on networked systems may have heterogenous available times. If we ignore the availability constraints when dividing and distributing workloads among servers, some servers may not be able to start processing their assigned load fractions or deliver them on time. In view of this, we propose a new multi-installment scheduling model based on server availability time constraints. To solve this problem, we design an efficient heuristic algorithm consisting of a repair strategy and a local search strategy, by which an optimal load partitioning scheme is derived. The repair strategy guarantees time constraints, while the local search strategy achieves optimality. We evaluate the performance via rigorous simulation experiments and our results show that the proposed algorithm is suitable for solving large-scale scheduling problems employing heterogeneous servers with arbitrary available times. The proposed algorithm is shown to be superior to the existing algorithm in terms of achieving a shorter makespan of workloads.
Open AccessMaximizing Heterogeneous Server Utilization with Limited Availability Times for Divisible Loads Scheduling on Networked Systems
Most of the available divisible-load scheduling models assume that all servers in networked systems are idle before workloads arrive and that they can remain available online during workload computation. In fact, this assumption is not always valid. Different servers on networked systems may have heterogenous available times. If we ignore the availability constraints when dividing and distributing workloads among servers, some servers may not be able to start processing their assigned load fractions or deliver them on time. In view of this, we propose a new multi-installment scheduling model based on server availability time constraints. To solve this problem, we design an efficient heuristic algorithm consisting of a repair strategy and a local search strategy, by which an optimal load partitioning scheme is derived. The repair strategy guarantees time constraints, while the local search strategy achieves optimality. We evaluate the performance via rigorous simulation experiments and our results show that the proposed algorithm is suitable for solving large-scale scheduling problems employing heterogeneous servers with arbitrary available times. The proposed algorithm is shown to be superior to the existing algorithm in terms of achieving a shorter makespan of workloads.