A combination of game theory and genetic algorithm for load balancing in distributed computer systems
by Hajar Siar; Kourosh Kiani; Anthony T. Chronopoulos
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 9, No. 1, 2017

Abstract: High demand of computation and communication in recent decades has increased the importance of distributed computer systems. Because of the heterogeneity of resources, resource management is one of the main challenges in designing distributed computer systems. In this paper, a new method has been proposed for solving load balancing problem in distributed computer systems using game theory and a genetic algorithm. The load balancing problem has been modelled as a non-cooperative game among users of the system. The payoff function of players was computed using an introduced parameter in order to decrease the users' expected response time. Certain Nash equilibriums are unstable in a multi agent problem. Thus, a genetic algorithm based on the concept of Nash equilibrium is used for solving the load balancing game. Simulation results show the performance of the proposed load balancing algorithm in terms of the expected response time and fairness index as parameters in evaluating the performance of load balancing algorithms.

Online publication date: Mon, 26-Dec-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com