17 June 2019 in EURASIP Journal on Wireless Communications and Networking
With the rapid increase of user access, load balancing in cloud data center has become an important factor affecting cluster stability. From the point of view of green scheduling, this paper proposed a virtual machine intelligent scheduling strategy based on machine learning algorithm to achieve load balancing of cloud data center. Firstly, a load forecasting algorithm based on genetic algorithm (SVR_GA), k-means clustering algorithm based on optimized min-max, and adaptive differential evolution algorithm (ESA_DE) to enhance local search ability are proposed to solve the load imbalance problem in cloud data center. The experimental results showed that compared with other classical algorithms, the proposed virtual machine scheduling strategy reduces the number of virtual machine migration by 94.5% and the energy consumption of cloud data center by 49.13%.
23 November 2021 in Mobile Information Systems
Spatial data occupies a large proportion of the large amount of data that is constantly emerging, but a large amount of spatial data cannot be directly understood by people. Even a highly configured stand-alone computing device can hardly meet the needs of visualization processing. In order to protect the security of data and facilitate for users the search for data and recover by mistake, this paper conducts a research on cloud computing storage backup and recovery strategies based on the secure Internet of Things and Spark platform. In the method part, this article introduces the security Internet of Things, Spark, and cloud computing backup and recovery related content and proposes cluster analysis and Ullman two algorithms. In the experimental part, this article explains the experimental environment and experimental objects and designs an experiment for data recovery. In the analysis part, this article analyzes the challenge-response-verification framework, the number of data packets, the cost of calculation and communication, the choice of Spark method, the throughput of different platforms, and the iteration and cache analysis. The experimental results show that the loss rate of database 1 in the fourth node is 0.4%, 2.4%, 1.6%, and 3.2% and the loss rate of each node is less than 5%, indicating that the system can respond to applications.
1 October 2021 in IEICE Transactions on Information and Systems
Service composition optimization is a classic NP-hard problem. How to quickly select high-quality services that meet user needs from a large number of candidate services is a hot topic in cloud service composition research. An efficient second-order beetle swarm optimization is proposed with a global search ability to solve the problem of cloud service composition optimization in this study. First, the beetle antennae search algorithm is introduced into the modified particle swarm optimization algorithm, initialize the population bying using a chaotic sequence, and the modified nonlinear dynamic trigonometric learning factors are adopted to control the expanding capacity of particles and global convergence capability. Second, modified secondary oscillation factors are incorporated, increasing the search precision of the algorithm and global searching ability. An adaptive step adjustment is utilized to improve the stability of the algorithm. Experimental results founded on a real data set indicated that the proposed global optimization algorithm can solve web service composition optimization problems in a cloud environment. It exhibits excellent global searching ability, has comparatively fast convergence speed, favorable stability, and requires less time cost.
1 November 2020 in Journal of Physics: Conference Series
With the continuous development of cloud computing technology and big data, web services are widely used in intelligent information processing in all walks of life, when facing a large number of services with similar functions and quality, web service composition technology is a crucial technology in web services, which enable common services to be combined and select the optimal service combination to meet the wide range of users’ needs. Aiming at the problems of algorithm accuracy and stability of existing service composition technologies, the penalty function is used to construct the fitness function in this paper, which transforms the constrained optimization problem into an unconstrained optimization problem, and realizes the global optimization. Traditional web service composition models are aimed at QoS attribute perception. This paper establishes a QoE model that focuses on user experience, which can better meet the needs of users. An adaptive mutant beetle herd algorithm was proposed in this paper, the author introduced Beetle Antennae Searching Algorithm into the common particle swarm optimization algorithm, and added an adaptive mutation factor to enhance the searching ability of the algorithm; The use of dynamic learning factors allows the algorithm to have better population diversity and enhanced convergence. The experimental results that the algorithm proposed in this paper has higher algorithm accuracy, comparatively faster convergence speed and stability.
20 October 2020 in IEEE Access
Under a multiscenario environment with frequent bursts of data in the edge cloud, the resource allocation in the edge cloud will affect the stability of its nodes. To address this problem, a balanced virtual resource allocation model based on conflict conditions is proposed. Based on a thorough study of the similarity between task attributes and resources used by the host, the concept of a task backlog is implemented to achieve a preliminary balanced allocation of tasks; thus, a conflict condition based on the remaining resources of the physical and virtual machines is proposed. Further, a matrix of phased conflict coefficients is built to establish a balanced virtual machine allocation model. The results of experiments comparing the performance of the proposed model with that of other existing models indicate that the proposed model can reduce the virtual machine scheduling time by up to 8.33%, save up to 6.25% of host energy consumption, and improve the algorithm efficiency by 20.47% compared with the other algorithms. To avoid the local optimal problem caused by dynamic virtual machine migration, an improved ant colony algorithm is combined with the above model, and concepts of a pheromone volatility factor and suppression factor are implemented to optimize the pheromone measurement function and ensure that the virtual machine migration path is globally optimal. Overall, the model reduces the conflict rate of resources on the physical machine and can maintain stable operation under CPU usage fluctuation, thus realizing a balanced allocation of node resources.