1 February 2022 in IEEE Transactions on Parallel and Distributed Systems
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.
23 December 2021 in IEEE Transactions on Network and Service Management
Intelligent task scheduling solutions are highly demanded in the operation of complex cloud data centers so that resources can be utilized in an energy-efficient way while still ensuring various requirements of users. However, the energy problem of task scheduling in cloud environment becomes more challenging with the ever-increasing number of users as well as the constant and unpredictable change of workloads. In this research, we propose an Adaptive Deep Reinforcement Learning-based (ADRL) task scheduling framework for energy-efficient cloud computing. We first present a Change Detection algorithm to detect whether the workload has changed greatly. On this basis, we built an Automatic Generation network to adjust the discount factor of Deep Reinforcement Learning (DRL) dynamically according to the changing workload, which enables faster and more accurate learning. We finally introduce the adaptive DRL to learn the optimal policy of dispatching arriving user requests with the reward aiming to minimize task response time and maximize resource utilization. Simulated experiments have confirmed that the proposed scheduling scheme performs well on accelerating learning convergence and promoting allocation accuracy, thus it is very effective in reducing the average response time of tasks and increasing the CPU utilization rate of resources, which eventually makes the cloud system more energy efficient.
8 January 2021 in IEEE Transactions on Services Computing
The ever-increasing diversity and dynamic of cloud environment pose many challenges on QoS prediction in service recommendation. One such challenge is how to extract and learn deep features of users/services from multi-source information to improve prediction accuracy. In this article, we propose a novel Joint Deep Networks based Multi-source Feature Learning(JDNMFL) framework for QoS prediction. JDNMFL has two parts: Multi-source Feature Extraction and Feature Interaction Learning. In the first part, a latent factor embedding method is first proposed to capture implicit features from QoS matrix, and then the multi-source features, combined by explicit features from WSDL(Web Services Description Language) document and contextual data as well as implicit features, are extracted based on the combination of matrix factorization and neural networks. In the second part, the CNN(Convolutional Neural Network)-based joint deep networks are built to learn both local and global high-order feature interactions, and to complete the final QoS prediction based on mixed features. Experimental results demonstrate that our JDNMFL approach can not only extract and integrate implicit and explicit features of various multi-source data, but also can learn feature sequence and feature interactions, so that it is very effective in improving the accuracy of QoS prediction with sparse data.
12 February 2021 in Applied Intelligence
20 September 2023 in IEEE Transactions on Services Computing
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 in IEEE Transactions on Network and Service Management
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.