Load balancing via random local search in closed and open systems

In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch servers independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly relevant in scenarios where clients cannot predict the load of a server before being actually attached to it. An important example is in wireless spectrum sharing where clients try to share a set of frequency bands in a distributed manner. We first analyze the natural Random Local Search (RLS) strategy. Under this strategy, after sampling a new server randomly, clients only switch to it if their service rate is improved. In closed systems, where the client population is fixed, we derive tight estimates of the time it takes under RLS strategy to balance the load across servers. We then study open systems where clients arrive according to a random process and leave the system upon service completion. In this scenario, we analyze how client migrations within the system interact with the system dynamics induced by client arrivals and departures. We compare the load-aware RLS strategy to a load-oblivious strategy in which clients just randomly switch server without accounting for the server loads. Surprisingly, we show that both load-oblivious and load-aware strategies stabilize the system whenever this is at all possible. We further demonstrate, using large-system asymptotics, that the average client sojourn time under the load-oblivious strategy is not considerably reduced when clients apply smarter load-aware strategies.

[1]  Florian Simatos,et al.  Spatial homogenization in a stochastic network with mobility , 2008, 0807.1205.

[2]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[3]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[4]  Iman Hajirasouliha,et al.  Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks , 2007, ESA.

[5]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[6]  Paul W. Goldberg,et al.  Distributed selfish load balancing , 2005, SODA '06.

[7]  A. Sznitman.  Topics in propagation of chaos , 1991 .

[8]  Jon M. Kleinberg,et al.  Stability of load balancing algorithms in dynamic adversarial systems , 2002, STOC '02.

[9]  Martin Gairing,et al.  Nashification and the Coordination Ratio for a Selfish Routing Game , 2003, ICALP.

[10]  Pierre Del Moral.  Propagation of Chaos , 2004 .

[11]  Leslie Ann Goldberg,et al.  The natural work-stealing algorithm is stable , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  C. Graham.  Chaoticity on path space for a queueing network with selection of the shortest queue among several , 2000, Journal of Applied Probability.

[13]  Paul W. Goldberg,et al.  Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.

[14]  Alexandre Proutière,et al.  A particle system in interaction with a rapidly varying environment: Mean field limits and applications , 2010, Networks Heterog. Media.

[15]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[16]  Sem C. Borst,et al.  Capacity of Wireless Data Networks with Intra- and Inter-Cell Mobility , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Iman Hajirasouliha,et al.  Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks , 2010, Algorithmica.

[18]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[19]  Yishay Mansour,et al.  Convergence time to Nash equilibrium in load balancing , 2007, TALG.

[20]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[21]  Ravi P. Agarwal,et al.  Convergence to Equilibria , 1997 .

[22]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[23]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[24]  Mor Harchol-Balter.  Task assignment with unknown duration , 2002, JACM.

[25]  M. Manhart,et al.  Markov Processes , 2018, Introduction to Stochastic Processes and Simulation.

[26]  Ariel Orda,et al.  Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.