Ding Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ding Ding has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Huamao Xie
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China
7 shared publications - Kang
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China
5 shared publications - Lihong Zhao
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China
3 shared publications - Jing Zeng
School of Computer and Information Technology, Beijing Jiaotong University, 47829 Beijing, Beijing, China
2 shared publications Lihong Zhao
2 shared publications- Yaqing Jin
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China
2 shared publications
Latest Publications
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 1896-1911
SPAD: Spatial Perception and Action Decoupling Empowered Multi-Agent AI Task Scheduling Framework in Cloud-Edge Computing
Multi-agent reinforcement learning provides promising prospect for task scheduling in cloud-edge computing environment in recent years. However, there remains a formidable challenge due to partial observation and the rigid coupling between action spaces and schedulable devices. These limit the ability of agent to perceive global communication patterns and adapt to dynamic environments, resulting in unsatisfactory scheduling decisions. To address these issues, this work proposes SPAD, a novel spatial perception and action decoupling empowered distributed multi-agent AI task scheduling framework. By constructing a global spatial feature distillation mechanism, SPAD can approximate the implicit heterogeneous connection patterns and communication dynamics between devices and tasks under constrained observability, enhancing its ability to make robust decisions in dynamic environments with limited observations. Additionally, SPAD employs a Lyapunov-based action decoupling module to alleviate scalability challenges from rigid action-device coupling, while a novel intrinsic penalty mechanism augments the agent’s advantage function with the instantaneous Lyapunov cost, thereby aligning the policy optimization process with the decoupling module’s underlying stability constraints. Through a comprehensive empirical evaluation spanning synthetic, bursty, and real-world trace-driven workloads, we show that SPAD consistently outperforms state-of-the-art benchmarks in reducing task completion latency and improving resource utilization, while maintaining remarkable resilience and scalability across diverse network topologies and under non-stationary load conditions.
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 1896-1911
SPAD: Spatial Perception and Action Decoupling Empowered Multi-Agent AI Task Scheduling Framework in Cloud-Edge Computing
Multi-agent reinforcement learning provides promising prospect for task scheduling in cloud-edge computing environment in recent years. However, there remains a formidable challenge due to partial observation and the rigid coupling between action spaces and schedulable devices. These limit the ability of agent to perceive global communication patterns and adapt to dynamic environments, resulting in unsatisfactory scheduling decisions. To address these issues, this work proposes SPAD, a novel spatial perception and action decoupling empowered distributed multi-agent AI task scheduling framework. By constructing a global spatial feature distillation mechanism, SPAD can approximate the implicit heterogeneous connection patterns and communication dynamics between devices and tasks under constrained observability, enhancing its ability to make robust decisions in dynamic environments with limited observations. Additionally, SPAD employs a Lyapunov-based action decoupling module to alleviate scalability challenges from rigid action-device coupling, while a novel intrinsic penalty mechanism augments the agent’s advantage function with the instantaneous Lyapunov cost, thereby aligning the policy optimization process with the decoupling module’s underlying stability constraints. Through a comprehensive empirical evaluation spanning synthetic, bursty, and real-world trace-driven workloads, we show that SPAD consistently outperforms state-of-the-art benchmarks in reducing task completion latency and improving resource utilization, while maintaining remarkable resilience and scalability across diverse network topologies and under non-stationary load conditions.
- 25 March 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (7) , 1-15
Dual heterogeneous graph contrastive learning for QoS prediction
- 25 March 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (7) , 1-15
Dual heterogeneous graph contrastive learning for QoS prediction
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (4) , 1200-1217
Transfer Learning Based Multi-Objective Evolutionary Algorithm for Dynamic Workflow Scheduling in the Cloud
Managing scientific applications in the Cloud poses many challenges in terms of workflow scheduling, especially in handling multi-objective workflow scheduling under quality of service (QoS) constraints. However, most studies address the workflow scheduling problem on the premise of the unchanged environment, without considering the high dynamics of the Cloud. In this paper, we model the constrained workflow scheduling in a dynamic Cloud environment as a dynamic multi-objective optimization problem with preferences, and propose a transfer learning based multi-objective evolutionary algorithm (TL-MOEA) to tackle the workflow scheduling problem of dynamic nature. Specifically, an elite-led transfer learning strategy is proposed to explore effective parameter adaptation for the MOEA by transferring helpful knowledge from elite solutions in the past environment to accelerate the optimization process. In addition, a multi-space diversity learning strategy is developed to maintain the diversity of the population. To satisfy various QoS constraints of workflow scheduling, a preference-based selection strategy is further designed to enable promising solutions for each iteration. Extensive experiments on five well-known scientific workflows demonstrate that TL-MOEA can achieve highly competitive performance compared to several state-of-art algorithms, and can obtain triple win solutions with optimization objectives of minimizing makespan, cost and energy consumption for dynamic workflow scheduling with user-defined constraints.
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (4) , 1200-1217
Transfer Learning Based Multi-Objective Evolutionary Algorithm for Dynamic Workflow Scheduling in the Cloud
Managing scientific applications in the Cloud poses many challenges in terms of workflow scheduling, especially in handling multi-objective workflow scheduling under quality of service (QoS) constraints. However, most studies address the workflow scheduling problem on the premise of the unchanged environment, without considering the high dynamics of the Cloud. In this paper, we model the constrained workflow scheduling in a dynamic Cloud environment as a dynamic multi-objective optimization problem with preferences, and propose a transfer learning based multi-objective evolutionary algorithm (TL-MOEA) to tackle the workflow scheduling problem of dynamic nature. Specifically, an elite-led transfer learning strategy is proposed to explore effective parameter adaptation for the MOEA by transferring helpful knowledge from elite solutions in the past environment to accelerate the optimization process. In addition, a multi-space diversity learning strategy is developed to maintain the diversity of the population. To satisfy various QoS constraints of workflow scheduling, a preference-based selection strategy is further designed to enable promising solutions for each iteration. Extensive experiments on five well-known scientific workflows demonstrate that TL-MOEA can achieve highly competitive performance compared to several state-of-art algorithms, and can obtain triple win solutions with optimization objectives of minimizing makespan, cost and energy consumption for dynamic workflow scheduling with user-defined constraints.
- 5 January 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 154, 160-172
Imitation learning enabled fast and adaptive task scheduling in cloud
- 5 January 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 154, 160-172
Imitation learning enabled fast and adaptive task scheduling in cloud
- 7 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
A two-stage preference driven multi-objective evolutionary algorithm for workflow scheduling in the Cloud
- 7 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
A two-stage preference driven multi-objective evolutionary algorithm for workflow scheduling in the Cloud
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (3) , 1154-1167
Robust QoS Prediction Based on Reputation Integrated Graph Convolution Network
With the proliferation of Web services, it is very difficult for inexperienced users to select the most appropriate service among numerous functionally identical or similar candidates, thus prediction of Quality of Service (QoS) becomes a growing concern in service discovery, selection and recommendation. However, a huge challenge is that in the reality of the existence of untrustworthy users, how the Web service recommendation system keeps the robustness of the QoS prediction while maintaining high accuracy. To address this problem, a Reputation Integrated Graph Convolution Network (RIGCN) is developed in this paper to realize robust and accurate QoS prediction. RIGCN has three main parts: Reputation Extraction, Multi-source Feature Extraction and GCN-based QoS Prediction. First, an Outlier and Pattern Measure (OPM) method is proposed to extract the real reputation of users based on both outliers and the distribution patterns of the historical QoS interaction records. Second, deep features of users and services are captured by multi-source feature extraction with an attention mechanism to make full use of the contextual information in service invocation. On this basis, a graph convolution network is specially designed to integrate multi-source features and user reputation in the message propagation process to complete final QoS prediction. Experimental results demonstrate that our RIGCN approach can not only extract and utilize implicit and explicit features of various multi-source data, but also can reduce the negative influence of untrustworthy users. Therefore, it is very robust and effective in improving the accuracy of QoS prediction with sparse and noisy data.
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (3) , 1154-1167
Robust QoS Prediction Based on Reputation Integrated Graph Convolution Network
With the proliferation of Web services, it is very difficult for inexperienced users to select the most appropriate service among numerous functionally identical or similar candidates, thus prediction of Quality of Service (QoS) becomes a growing concern in service discovery, selection and recommendation. However, a huge challenge is that in the reality of the existence of untrustworthy users, how the Web service recommendation system keeps the robustness of the QoS prediction while maintaining high accuracy. To address this problem, a Reputation Integrated Graph Convolution Network (RIGCN) is developed in this paper to realize robust and accurate QoS prediction. RIGCN has three main parts: Reputation Extraction, Multi-source Feature Extraction and GCN-based QoS Prediction. First, an Outlier and Pattern Measure (OPM) method is proposed to extract the real reputation of users based on both outliers and the distribution patterns of the historical QoS interaction records. Second, deep features of users and services are captured by multi-source feature extraction with an attention mechanism to make full use of the contextual information in service invocation. On this basis, a graph convolution network is specially designed to integrate multi-source features and user reputation in the message propagation process to complete final QoS prediction. Experimental results demonstrate that our RIGCN approach can not only extract and utilize implicit and explicit features of various multi-source data, but also can reduce the negative influence of untrustworthy users. Therefore, it is very robust and effective in improving the accuracy of QoS prediction with sparse and noisy data.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (2) , 918-931
Spatial Context-Aware Time-Series Forecasting for QoS Prediction
With the explosive growth of web services, the increasing sparse and dynamic QoS (quality of service) data pose a great challenge to QoS prediction in service recommendation. How to fully utilize the contextual information of service invocation and their potential relationships becomes the key to improving the accuracy of QoS prediction. In this paper, a spatial context-aware time series forecasting (SCATSF) framework is proposed for QoS prediction by considering both the temporal and the spatial context of users and services. SCATSF has three main parts: time-aware neighbors selection, spatial context-aware interaction learning and time series forecasting for QoS prediction. First, a novel time series similarity (TSS) is proposed to measure the similarity of users or services based on time-varying QoS fluctuation, in order to select appropriate neighbors for the target user or service. Furthermore, the contextual information of neighbors, as well as the contextual information of users and services, are both integrated to enrich the spatial context of service invocation, and a pairwise multi-layer deep network (PMLDN) is developed to consolidate multiple features and to learn feature interactions in pairs. With the help of spatial contextual information and time-aware QoS information, a spatial context-aware GRU model (SCA-GRU) is finally present to complete the time series forecasting for QoS prediction. Experimental results on the prediction of response time in a real-world dataset demonstrate that our SCATSF approach can effectively utilize spatio-temporal contextual information, so that it can achieve higher accuracy than many existing methods.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (2) , 918-931
Spatial Context-Aware Time-Series Forecasting for QoS Prediction
With the explosive growth of web services, the increasing sparse and dynamic QoS (quality of service) data pose a great challenge to QoS prediction in service recommendation. How to fully utilize the contextual information of service invocation and their potential relationships becomes the key to improving the accuracy of QoS prediction. In this paper, a spatial context-aware time series forecasting (SCATSF) framework is proposed for QoS prediction by considering both the temporal and the spatial context of users and services. SCATSF has three main parts: time-aware neighbors selection, spatial context-aware interaction learning and time series forecasting for QoS prediction. First, a novel time series similarity (TSS) is proposed to measure the similarity of users or services based on time-varying QoS fluctuation, in order to select appropriate neighbors for the target user or service. Furthermore, the contextual information of neighbors, as well as the contextual information of users and services, are both integrated to enrich the spatial context of service invocation, and a pairwise multi-layer deep network (PMLDN) is developed to consolidate multiple features and to learn feature interactions in pairs. With the help of spatial contextual information and time-aware QoS information, a spatial context-aware GRU model (SCA-GRU) is finally present to complete the time series forecasting for QoS prediction. Experimental results on the prediction of response time in a real-world dataset demonstrate that our SCATSF approach can effectively utilize spatio-temporal contextual information, so that it can achieve higher accuracy than many existing methods.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. PP (10459219) , 1
Adaptive DRL-based Virtual Machine Consolidation in Energy-Efficient Cloud Data Center
The dramatic increasing of data and demands for computing capabilities may result in excessive use of resources in cloud data centers, which not only causes the raising of energy consumption, but also leads to the violation of Service Level Agreement (SLA). Dynamic consolidation of virtual machines (VMs) is proven to be an efficient way to tackle this issue. In this paper, we present an Adaptive Deep Reinforcement Learning (DRL)-based Virtual Machine Consolidation (ADVMC) framework for energy-efficient cloud data centers. ADVMC has two phases. In the first phase, Influence Coefficient is introduced to measure the impact of a VM on producing host overload, and a dynamic Influence Coefficient-based VM selection algorithm (ICVMS) is proposed to preferentially choose those VMs with the greatest impact for migration in order to remove the excessive workloads of the overloaded host quickly and accurately. In the second phase, a Prediction Aware DRL-based VM placement method (PADRL) is further proposed to automatically find suitable hosts for VMs to be migrated, in which a state prediction network is designed based on LSTM to provide DRL-based model more reasonable environment states so as to accelerate the convergence of DRL. Simulation experiments on the real-world workload provided by Google Cluster Trace have shown that our ADVMC approach can largely cut down system energy consumption and reduce SLA violation of users as compared to many other VM consolidation policies.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. PP (10459219) , 1
Adaptive DRL-based Virtual Machine Consolidation in Energy-Efficient Cloud Data Center
The dramatic increasing of data and demands for computing capabilities may result in excessive use of resources in cloud data centers, which not only causes the raising of energy consumption, but also leads to the violation of Service Level Agreement (SLA). Dynamic consolidation of virtual machines (VMs) is proven to be an efficient way to tackle this issue. In this paper, we present an Adaptive Deep Reinforcement Learning (DRL)-based Virtual Machine Consolidation (ADVMC) framework for energy-efficient cloud data centers. ADVMC has two phases. In the first phase, Influence Coefficient is introduced to measure the impact of a VM on producing host overload, and a dynamic Influence Coefficient-based VM selection algorithm (ICVMS) is proposed to preferentially choose those VMs with the greatest impact for migration in order to remove the excessive workloads of the overloaded host quickly and accurately. In the second phase, a Prediction Aware DRL-based VM placement method (PADRL) is further proposed to automatically find suitable hosts for VMs to be migrated, in which a state prediction network is designed based on LSTM to provide DRL-based model more reasonable environment states so as to accelerate the convergence of DRL. Simulation experiments on the real-world workload provided by Google Cluster Trace have shown that our ADVMC approach can largely cut down system energy consumption and reduce SLA violation of users as compared to many other VM consolidation policies.