Ying 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
Research Interests
Ying Wang has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
- Xuesong Qiu
Beijing University of Posts and Telecommunications
13 shared publications - Peng Yu
Beijing University of Posts and Telecommunications
12 shared publications - Shaoyong Guo
Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications - Wenjing Li
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications - Lin Cong
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Mohamed Cheriet
University of Quebec
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 50417-50429
Cross-Domain Routing and Resource Allocation for Computing Power Network
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 50417-50429
Cross-Domain Routing and Resource Allocation for Computing Power Network
- 25 March 2026
- Published by Elsevier in Computer Networks
- Vol. 282
Eco-efficient task scheduling for MLLMs in edge-cloud continuum
- 25 March 2026
- Published by Elsevier in Computer Networks
- Vol. 282
Eco-efficient task scheduling for MLLMs in edge-cloud continuum
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7114-7126
Dynamic E2E Channel Orchestration in Metro Transport Network
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7114-7126
Dynamic E2E Channel Orchestration in Metro Transport Network
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 5992-6009
Graph-Aware Diffusion Policy for Fault-Tolerant Agentic AI Service Migration in Edge Computing Power Networks
In edge computing power network environments, there is a growing demand to support compute-intensive Agentic AI Services, which are composed of interdependent functions represented as Directed Acyclic Graphs (DAGs). Nevertheless, the challenges posed by dynamic resource volatility and potential node failures significantly impact reliable task execution. Existing solutions (often reactive heuristics or GAN-based models) struggle to anticipate risks and overlook DAG dependencies. This paper introduces GADP, a Graph-Aware Diffusion Policy framework designed to facilitate proactive fault-tolerant DAG workload migration in large-scale edge computing systems. This paper presents GADP, a Graph-Aware Diffusion Policy framework for proactive, fault-tolerant DAG workload migration in large-scale edge systems. GADP integrates three key modules: a Transformer-GAT fault predictor for failure probability and type estimation; a DAG encoder that learns structure-preserving task embeddings via multi-round attention; and a diffusion policy generator that refines placement strategies through conditional denoising. Experiments on dynamic simulations with real workload traces show that GADP achieves 99.6% fault detection accuracy, 95.4% diagnosis F1, and over 60% fewer SLO violations, while consuming the least energy among baselines. These results demonstrate GADP's robustness and effectiveness in anticipatory migration under volatile edge conditions.
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 5992-6009
Graph-Aware Diffusion Policy for Fault-Tolerant Agentic AI Service Migration in Edge Computing Power Networks
In edge computing power network environments, there is a growing demand to support compute-intensive Agentic AI Services, which are composed of interdependent functions represented as Directed Acyclic Graphs (DAGs). Nevertheless, the challenges posed by dynamic resource volatility and potential node failures significantly impact reliable task execution. Existing solutions (often reactive heuristics or GAN-based models) struggle to anticipate risks and overlook DAG dependencies. This paper introduces GADP, a Graph-Aware Diffusion Policy framework designed to facilitate proactive fault-tolerant DAG workload migration in large-scale edge computing systems. This paper presents GADP, a Graph-Aware Diffusion Policy framework for proactive, fault-tolerant DAG workload migration in large-scale edge systems. GADP integrates three key modules: a Transformer-GAT fault predictor for failure probability and type estimation; a DAG encoder that learns structure-preserving task embeddings via multi-round attention; and a diffusion policy generator that refines placement strategies through conditional denoising. Experiments on dynamic simulations with real workload traces show that GADP achieves 99.6% fault detection accuracy, 95.4% diagnosis F1, and over 60% fewer SLO violations, while consuming the least energy among baselines. These results demonstrate GADP's robustness and effectiveness in anticipatory migration under volatile edge conditions.
- 8 May 2025
- Published by Springer Nature
- p. 383-394
DNN Inference Task Reconstruction Algorithm for Edge Fault
- 8 May 2025
- Published by Springer Nature
- p. 383-394
DNN Inference Task Reconstruction Algorithm for Edge Fault
- 7 May 2025
- Published by Springer Nature
- p. 321-330
Traffic Scheduling Simulation System for Time-Sensitive Networking
- 7 May 2025
- Published by Springer Nature
- p. 321-330
Traffic Scheduling Simulation System for Time-Sensitive Networking
- 7 May 2025
- Published by Springer Nature
- p. 309-320
Computing Power Task Placement Method Based on New Energy Generation Power Prediction
- 7 May 2025
- Published by Springer Nature
- p. 309-320
Computing Power Task Placement Method Based on New Energy Generation Power Prediction
- 7 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 71 (2) , 411-425
FTBM: A Fault-Tolerant BIER Multicast for MBMS in 5G/B5G Dynamic Edge Networks
The evolution of 5G and Beyond 5G (B5G) networks has intensified the demand for efficient Multimedia Broadcast Multicast Services (MBMS), particularly in dynamic edge environments. The frequent alterations in network topology and multicast group configurations in these environments present substantial scalability challenges for traditional IP MultiCast (IPMC) mechanisms. Bit Index Explicit Replication (BIER) offers a stateless IPMC alternative that mitigates the limitations of traditional IPMC mechanisms. However, it still encounters fault tolerance issues in dynamic edge networks, where link faults occur frequently. This paper propose a Fault-Tolerant BIER Multicast (FTBM) mechanism specifically designed for MBMS in dynamic edge networks. FTBM optimizes BIER multicast paths by employing Multi-Agent Deep Reinforcement Learning (MADRL) to minimize transmission delays while addressing constraints such as random link faults, limited queue capacity, and forwarding restrictions. Extensive simulations demonstrate that FTBM significantly enhances multicast performance under varying traffic loads and dense fault conditions, leading to improved transmission efficiency and network load balancing. This work provides a resilient and scalable solution for next-generation MBMS in dynamic network environments.
- 7 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 71 (2) , 411-425
FTBM: A Fault-Tolerant BIER Multicast for MBMS in 5G/B5G Dynamic Edge Networks
The evolution of 5G and Beyond 5G (B5G) networks has intensified the demand for efficient Multimedia Broadcast Multicast Services (MBMS), particularly in dynamic edge environments. The frequent alterations in network topology and multicast group configurations in these environments present substantial scalability challenges for traditional IP MultiCast (IPMC) mechanisms. Bit Index Explicit Replication (BIER) offers a stateless IPMC alternative that mitigates the limitations of traditional IPMC mechanisms. However, it still encounters fault tolerance issues in dynamic edge networks, where link faults occur frequently. This paper propose a Fault-Tolerant BIER Multicast (FTBM) mechanism specifically designed for MBMS in dynamic edge networks. FTBM optimizes BIER multicast paths by employing Multi-Agent Deep Reinforcement Learning (MADRL) to minimize transmission delays while addressing constraints such as random link faults, limited queue capacity, and forwarding restrictions. Extensive simulations demonstrate that FTBM significantly enhances multicast performance under varying traffic loads and dense fault conditions, leading to improved transmission efficiency and network load balancing. This work provides a resilient and scalable solution for next-generation MBMS in dynamic network environments.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (24) , 40656-40669
Lightweight Federated-Learning-Driven Traffic Prediction for Heterogeneous IoT Networks
With the rapid development of the Internet of Things (IoT), more and more IoT traffic is generated in the data network. Accurate perception of IoT traffic changes will facilitate traffic engineering decisions, thus ensuring the performance of IoT applications. However, current traffic prediction methods ignore the limitations of actual application environment. In this paper, we propose an IoT traffic prediction method based on horizontal federated learning to predict traffic trends under the cooperation of the cloud and the edge side. In order to improve the accuracy of IoT traffic prediction, a traffic prediction model SMN3-CIFGA is proposed to predict IoT traffic based on traffic feature extraction in a limited hardware environment. In addition, in order to improve the communication efficiency in the distributed training process of the traffic prediction model, we propose a gradient compression algorithm based on dynamic threshold GCADT. The experimental results demonstrate that compared with current methods, the average training time of the GCADT algorithm is reduced by about 6.21%, the transmission gradient size of the GCADT is reduced by about 66.71%, the average training time of the classification model SMN3 is reduced by about 40%, and the testing set prediction accuracy of SMN3-CIFGA can reach 97.61%.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (24) , 40656-40669
Lightweight Federated-Learning-Driven Traffic Prediction for Heterogeneous IoT Networks
With the rapid development of the Internet of Things (IoT), more and more IoT traffic is generated in the data network. Accurate perception of IoT traffic changes will facilitate traffic engineering decisions, thus ensuring the performance of IoT applications. However, current traffic prediction methods ignore the limitations of actual application environment. In this paper, we propose an IoT traffic prediction method based on horizontal federated learning to predict traffic trends under the cooperation of the cloud and the edge side. In order to improve the accuracy of IoT traffic prediction, a traffic prediction model SMN3-CIFGA is proposed to predict IoT traffic based on traffic feature extraction in a limited hardware environment. In addition, in order to improve the communication efficiency in the distributed training process of the traffic prediction model, we propose a gradient compression algorithm based on dynamic threshold GCADT. The experimental results demonstrate that compared with current methods, the average training time of the GCADT algorithm is reduced by about 6.21%, the transmission gradient size of the GCADT is reduced by about 66.71%, the average training time of the classification model SMN3 is reduced by about 40%, and the testing set prediction accuracy of SMN3-CIFGA can reach 97.61%.
- Open Access
- 28 August 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (9) , 312
AI Services-Oriented Dynamic Computing Resource Scheduling Algorithm Based on Distributed Data Parallelism in Edge Computing Network of Smart Grid
Massive computational resources are required by a booming number of artificial intelligence (AI) services in the communication network of the smart grid. To alleviate the computational pressure on data centers, edge computing first network (ECFN) can serve as an effective solution to realize distributed model training based on data parallelism for AI services in smart grid. Due to AI services with diversified types, an edge data center has a changing workload in different time periods. Selfish edge data centers from different edge suppliers are reluctant to share their computing resources without a rule for fair competition. AI services-oriented dynamic computational resource scheduling of edge data centers affects both the economic profit of AI service providers and computational resource utilization. This letter mainly discusses the partition and distribution of AI data based on distributed model training and dynamic computational resource scheduling problems among multiple edge data centers for AI services. To this end, a mixed integer linear programming (MILP) model and a Deep Reinforcement Learning (DRL)-based algorithm are proposed. Simulation results show that the proposed DRL-based algorithm outperforms the benchmark in terms of profit of AI service provider, backlog of distributed model training tasks, running time and multi-objective optimization.
- 28 August 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (9) , 312
Open AccessAI Services-Oriented Dynamic Computing Resource Scheduling Algorithm Based on Distributed Data Parallelism in Edge Computing Network of Smart Grid
Massive computational resources are required by a booming number of artificial intelligence (AI) services in the communication network of the smart grid. To alleviate the computational pressure on data centers, edge computing first network (ECFN) can serve as an effective solution to realize distributed model training based on data parallelism for AI services in smart grid. Due to AI services with diversified types, an edge data center has a changing workload in different time periods. Selfish edge data centers from different edge suppliers are reluctant to share their computing resources without a rule for fair competition. AI services-oriented dynamic computational resource scheduling of edge data centers affects both the economic profit of AI service providers and computational resource utilization. This letter mainly discusses the partition and distribution of AI data based on distributed model training and dynamic computational resource scheduling problems among multiple edge data centers for AI services. To this end, a mixed integer linear programming (MILP) model and a Deep Reinforcement Learning (DRL)-based algorithm are proposed. Simulation results show that the proposed DRL-based algorithm outperforms the benchmark in terms of profit of AI service provider, backlog of distributed model training tasks, running time and multi-objective optimization.