|
| S. no. | Author(s), year | Resource allocation strategy | Resource optimization strategy | Benchmark tools | Benefits | Limitations |
|
| 1 | Xu and Yu, 2014 [45] | A finite extensive form game with perfect information | Backward induction approach | Hadoop scheduler, first fit algorithm, and Google cluster allocation mechanism | Perform better in fair allocation, diminish resource wastage, and attain a better resource utilization rate | |
| 2 | Nezarat and Dastghaibifard, 2015 [46] | A repetitive game with incomplete information in a non-cooperative environment | Nash equilibrium | | Achieve Nash equilibrium even with insufficient knowledge of the environment, respond in a shorter period, and provide the lowest violation of the service-level agreement and the most utility to the provider | It is considered a static pricing strategy rather than a dynamic resource allocation method |
| 3 | Xiao and Tang, 2015 [47] | A cooperative gaming model | Non-cooperative gaming model | Commodity market model, double auction model, Vickrey auction model, and batch auction model | Reduce the application execution latency and improve the price negotiation efficiency when bundles of resources are negotiated simultaneously | |
| 4 | Yan et al., 2016 [48] | Non-cooperative and bargaining game resource allocation algorithm | Nash equilibrium and Pareto efficiency | Hadoop mechanism, Google management mechanism, and general equilibrium algorithm | Ensure fair constraints, improve the efficiency of resource allocation, and provide resource competitors with optimal benefits and improved collective benefits | The slight increase in consumption |
| 5 | Khansari and Sharifian, 2019 [49] | Evolutionary game theory | Evaporation-based water cycle algorithm | Active-guided evolutionary game theory and NSGA-II | Be stable, reliable, and optimal; be advantageous for low latency, low bandwidth, and high-security applications, and improve the overall QoS | Although the optimization problem can be found in a reasonable time, it is not essentially the precise answer to the problem but an acceptable estimation |
| 6 | Swathy et al., 2020 [50] | A Stackelberg game-theoretical model | The load balancer | Traditional random allocation algorithms and flow-shop scheduling algorithm | Reduce the number of task failures, increase throughput and high resource utilization, decrease ‘makespan” value, and decrease the error rate | The whole load balancing process cannot be achieved by just executing this algorithm that is a long-term process |
| 7 | Carlucci et al., 2020 [51] | A non-cooperation model based on minority game theory | A decision model | The classic formulation of the minority game | Be adequate in allocating resources and react to an unexpected event with robustness | The use of homogeneous resources shared in the network |
| 8 | Zhanga et al., 2020 [52] | Integer programming model for the time-varying multidimensional resource allocation | Waiting period strategy and dominant-resource-based strategy to improve the social welfare and resource utilization | | Address the problem of online time-varying multidimensional resource allocation and pricing in clouds | |
|
