2015
DOI: 10.1007/s10586-015-0486-0
|View full text |Cite
|
Sign up to set email alerts
|

An effective game theoretic static load balancing applied to distributed computing

Abstract: In this paper an algorithm has been proposed to balance the loads in a distributed computing system based on game theory which models the load balancing problem as a non-cooperative game among the users. The proposed load balancing game, which is infinite and with perfect information, aims to establish fairness both in system and user level. The optimal or near-optimal solution of the game is approximated by a genetic algorithm and an introduced hybrid population-based simulated annealing algorithm, using the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
2

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 35 publications
0
5
0
2
Order By: Relevance
“…Game theory studies decision-making situations involving multiple parties and decisions of each party that influence the benefits and decisions of other parties. [24][25][26]. In [27], authors considered two issues: (i) load balancing for PMs, each PM consists of a set of VMs described as a multi-dimensional vector.…”
Section: Migration Strategy In Cloud Environmentmentioning
confidence: 99%
“…Game theory studies decision-making situations involving multiple parties and decisions of each party that influence the benefits and decisions of other parties. [24][25][26]. In [27], authors considered two issues: (i) load balancing for PMs, each PM consists of a set of VMs described as a multi-dimensional vector.…”
Section: Migration Strategy In Cloud Environmentmentioning
confidence: 99%
“…Each request for the load balancer should be able to be expressed on the basis of a set of indices that are similar to the type of Resource state indices. When processes have an access request to a resource or resources in the local computing system that cannot meet the constraints required by the process to continue the process execution, the load balancer will redistribute the load and will call the process migration through migration mechanisms [24,25]. In the third pattern, the process migration transmits a process to another computing node to meet the process requirements [26].…”
Section: Related Workmentioning
confidence: 99%
“…Each of the three mentioned patterns uses different mechanisms for carrying out the activity that the type and structure of the mechanisms are proportional to the architecture of the distributed system, the objectives and types of received requests [23,24,28]. Below is a review of some of the load distribution algorithms, resource exploration and process migration in distributed cluster, grid, peer to peer and cloud systems.…”
Section: Related Workmentioning
confidence: 99%
“…Một chính sách công bằng phổ biến khác là tối đa sự công bằng, bằng cách cố gắng tối đa hóa nguồn tài nguyên tối thiểu mà mỗi người dùng nhận được. Để đạt được việc công bằng giữa hệ thống và người dùng trong hệ thống phân tán, Siar và cộng sự đã mô hình hóa bài toán trên lý thuyết trò chơi [12]. Dùng giải thuật di truyền và lai ghép độ phổ biến của giải thuật luyện kim để xắp xỉ được giải pháp tối ưu hoặc gần tối ưu dựa trên cân bằng Nash.…”
Section: Các Nghiên Cứu Liên Quanunclassified
“…Từ tập phương án khả thi đó dựa vào điều kiện cân bằng Nash sẽ chọn ra phương án tốt nhất. Điều kiện dừng của thuật toán được tính theo Siar [12] như sau: ∑ ( ) (9)…”
Section: B Trò Chơi Cấp Phát Tài Nguyênunclassified