Tight Bounds for Selfish and Greedy Load Balancing

  • Authors:

  • Ioannis Caragiannis;Michele Flammini;Christos Kaklamanis;Panagiotis Kanellopoulos;Luca Moscardelli

  • Affiliations:

  • University of Patras, Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics, 26500, Rio, Greece;Università di L’Aquila, Dipartimento di Informatica, Via Vetoio, 67100, Coppito, L’Aquila, Italy;University of Patras, Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics, 26500, Rio, Greece;University of Patras, Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics, 26500, Rio, Greece;University of Chieti-Pescara, Department of Sciences, Viale Pindaro 42, 65127, Pescara, Italy

  • Venue:
  • Algorithmica
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the load balancing problem in the context of a set of clients each wishing to run a job on a server selected among a subset of permissible servers for the particular client. We consider two different scenarios. In selfish load balancing, each client is selfish in the sense that it chooses, among its permissible servers, to run its job on the server having the smallest latency given the assignments of the jobs of other clients to servers. In online load balancing, clients appear online and, when a client appears, it has to make an irrevocable decision and assign its job to one of its permissible servers. Here, we assume that the clients aim to optimize some global criterion but in an online fashion. A natural local optimization criterion that can be used by each client when making its decision is to assign its job to that server that gives the minimum increase of the global objective. This gives rise to greedy online solutions. The aim of this paper is to determine how much the quality of load balancing is affected by selfishness and greediness. We characterize almost completely the impact of selfishness and greediness in load balancing by presenting new and improved, tight or almost tight bounds on the price of anarchy of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency functions. In addition, we prove a tight upper bound on the price of stability of linear congestion games.