Fairness-Aware Mechanism for Load Balancing in Distributed Systems

Abstract

When a set of self-interested users shares multiple resources in a distributed system, we face the problem of allocating resources, called the load balancing problem. In particular, load balancing is defined as allocating the load to the servers of the distributed system such that jobs’ response time is minimized, and the utilization of servers is improved. In this article, the load balancing problem in a distributed system consists of a finite set of servers, and a finite set of users is studied. The load balancing problem considered here is a bi-objective problem with two highly probable conflicting objectives: (i) minimizing jobs’ response time (ii) providing the fair utilization of servers. In order to satisfy these two objectives simultaneously, both the objectives are considered in an integrated manner. Next, the load balancing problem is formulated as a noncooperative game; and to solve the game (i.e., to find the Nash equilibrium), a distributed load balancing algorithm (DLBA) is proposed. An experimental study is carried out to ascertain the efficacy of the proposed DLBA. Further, we compare DBLA with three existing load balancing approaches to evaluate its comparative effectiveness. The experimental results validate the effectiveness of the DLBA over the existing approaches.