2021
DOI: 10.1007/978-3-030-76508-8_22
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Virtual Machine Provisioning in Cloud Computing Using Game Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 31 publications
0
3
0
Order By: Relevance
“…It can model interactions among these parties to reach a Nash equilibrium, which represents a stable resource allocation strategy [318]. Game theory-based resource allocation models can be complex, computationally expensive, and may require substantial communication overhead to coordinate decisions among different entities [319]. Nonetheless, in dynamic cloud environments, achieving equilibrium may be challenging due to changing conditions and participants' strategies.…”
Section: Trade-offs and Discussionmentioning
confidence: 99%
“…It can model interactions among these parties to reach a Nash equilibrium, which represents a stable resource allocation strategy [318]. Game theory-based resource allocation models can be complex, computationally expensive, and may require substantial communication overhead to coordinate decisions among different entities [319]. Nonetheless, in dynamic cloud environments, achieving equilibrium may be challenging due to changing conditions and participants' strategies.…”
Section: Trade-offs and Discussionmentioning
confidence: 99%
“…It ensures fairness by selecting virtual machine groups with multiple resources fairly based on the current physical machine's remaining resource ratio and the available virtual machine resource ratio. In 2021, Abdelkarim Ait Temghart [9] introduced a non-cooperative game model to analyze the characteristics of market structure. This model ensures fairness in the sharing of available virtual machine resources in data centers while reducing the operating costs of operators and increasing profits.…”
Section: Related Workmentioning
confidence: 99%
“…Since the placement problem is proven to be NP-hard in the general case [14][15], [28][29], [34][35], alternative algorithms using different techniques are presented to solve it. Ant colony optimization (ACO) [14], [36], genetic algorithm (GA) [15][16], [30], greedy algorithm [4], [28], [33], game theory [32], and biogeography-based optimization (BBO) [37] are some of the heuristic or metaheuristic methods. Furthermore, some other models like graph [5], [8], [29], [33], approximation algorithms [38], and linear programming [9-10], [33] have been widely used to solve the problem.…”
Section: Related Workmentioning
confidence: 99%