z-logo
Premium
An energy‐aware method for data replication in the cloud environments using a Tabu search and particle swarm optimization algorithm
Author(s) -
Ebadi Yalda,
Jafari Navimipour Nima
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4757
Subject(s) - tabu search , particle swarm optimization , metaheuristic , computer science , mathematical optimization , cloud computing , ant colony optimization algorithms , replication (statistics) , energy consumption , multi swarm optimization , algorithm , mathematics , engineering , statistics , electrical engineering , operating system
Summary Cloud computing is a type of parallel, configurable, and flexible system, which refers to the provision of applications on virtual data centers. However, reducing the energy consumption and also maintaining high computation capacity have become timely and important challenges. The concept of replication is used to face these challenges. By increasing the number of data replicas, the energy consumption, the performance, and also the cost of creating and maintaining new replicas also are increased. Deciding on the number of required replicas and their location on the cloud system is an NP‐hard problem. In this paper, the problem is formulated as an optimization problem and a hybrid metaheuristic algorithm is offered to solve it. The algorithm uses the global search capability of the Particle Swarm Optimization (PSO) algorithm and the local search capability of the Tabu Search (TS) to get high‐quality solutions. The efficiency of the method is shown by comparing it with simple PSO, TS, and Ant Colony Optimization (ACO) algorithm on different test cases. The obtained results indicate that the method outperforms all of them in terms of consumed energy and cost.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here