Recursive competitive equilibrium approach for dynamic load balancing a distributed system

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Load balancing is very important and a common problem in distributed systems. The load balancing mechanism aims to fairly distribute load across the resources so as to optimize a given objective function. The objective can be system optimality which tries to minimize mean response time of all users or individual optimality which tries to minimize each user's individual response time. The load balancing can be achieved either statically or dynamically. In this paper we review, competitive equilibrium (CE) approach for static load balancing and then propose recursive competitive equilibrium (RCE) approach for dynamic load balancing. A computer model is run to evaluate the performance of proposed RCE scheme with static scheme using Nash equilibrium (NE) approach and the static scheme using CE. The results show that static scheme using CE and dynamic scheme using RCE achieved both system optimality and individual optimality simultaneously, while NE scheme achieved only individual optimality. Moreover the performance of RCE scheme is higher than CE when communication overhead is less and almost same as CE scheme when the communication overhead is more. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Shahu Chatrapati, K., Rekha, J. U., & Babu, A. V. (2011). Recursive competitive equilibrium approach for dynamic load balancing a distributed system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6536 LNCS, pp. 162–174). https://doi.org/10.1007/978-3-642-19056-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free