Load Balancing on the Data Center Broker Based on Game Theory and Metaheuristic Algorithms
Amine Mrhari*
Youssef Hadi†
Information Modeling and Communication
Systems Laboratory, Faculty of Sciences
Ibn Tofail University
Kenitra, Morocco
*amine.mrhari@gmail.com
†hadiyoussef@gmail.com
Abstract
The demand for computational resources increases year over year. In recent years, resource management has become among the main research problems in the cloud computing area. In this paper, we propose two solutions based on game theory and metaheuristic algorithms: particle swarm optimization and artificial bee colony optimization to approximate the optimal or near-optimal solution for load balancing in the data center broker, based on the expected response time of users. We consider the problem as a non-cooperative game among users. The simulation results show the comparison between the proposed algorithms and demonstrate the near-optimality in terms of expected response time.
Keywords: cloud computing; load balancing; non-cooperative games; game theory; evolutionary algorithms; Nash equilibrium, particle swarm optimization, artificial bee colony optimization
Cite this publication as:
A. Mrhari and Y. Hadi, “Load Balancing on the Data Center Broker Based on Game Theory and Metaheuristic Algorithms,” Complex Systems, 29(3), 2020 pp. 711–728.
https://doi.org/10.25088/ComplexSystems.29.3.711
