Tight Bounds for Selfish and Greedy Load Balancing

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 selects to run its job to the server among its permissible servers 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 and price of stability 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.

[1]  Csaba D. Tóth,et al.  Selfish load balancing and atomic congestion games , 2004, SPAA '04.

[2]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[3]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[4]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[5]  Marios Mavronicolas,et al.  A new model for selfish routing , 2004, Theor. Comput. Sci..

[6]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[7]  Yossi Azar,et al.  Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.

[8]  Paul G. Spirakis,et al.  The price of selfish routing , 2001, STOC '01.

[9]  Paul G. Spirakis,et al.  Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.

[10]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[11]  Ming-Yang Kao,et al.  Load balancing in the L/sub p/ norm , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

[13]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[14]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[15]  Edward G. Coffman,et al.  Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices , 1976, J. ACM.

[16]  Marios Mavronicolas,et al.  Computing Nash Equilibria for Scheduling on Restricted Parallel Links , 2004, STOC '04.

[17]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[18]  Yossi Azar,et al.  Ancient and New Algorithms for Load Balancing in the lp Norm , 1998, SODA '98.

[19]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[20]  Elias Koutsoupias,et al.  On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.

[21]  Noga Alon,et al.  Approximation schemes for scheduling , 1997, SODA '97.

[22]  Paul G. Spirakis,et al.  The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..

[23]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[24]  B. Awerbuch,et al.  Load Balancing in the Lp Norm , 1995, FOCS 1995.

[25]  Steven J. Phillips,et al.  Online load balancing and network flow , 1993, STOC.

[26]  Paul G. Spirakis,et al.  Selfish unsplittable flows , 2005, Theor. Comput. Sci..

[27]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.