Abstract
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach themselves 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 use large-system asymptotics to characterize system performance, and augment this with simulations, which suggest that the average client sojourn time under the load-oblivious strategy is not considerably reduced when clients apply smarter load-aware strategies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
≤st denotes the usual strong stochastic order, i.e., if x,y are probability measures on {0,…,m}, x≤st y iff for all j, \(\sum_{i=0}^{j}x_{i}\ge \sum_{i=0}^{j}y_{i}\).
References
IEEE Conference on Dynamic Spectrum Access. http://www.ieee-dyspan.org/
Anshelevich, D., Kleinberg, J.: Stability of load balancing algorithms in dynamic adversarial systems. SIAM J. Comput. 37(5), 1656–1673 (2008)
Berenbrink, P., Friedetzky, T., Goldberg, L.A.: The natural work-stealing algorithm is stable. SIAM J. Comput. 32(5), 1260–1279 (2003)
Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 354–363 (2006)
Berenbrink, P., Friedetzky, T., Hajirasouliha, I., Hu, Z.: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. In: LNCS, vol. 4698, pp. 41–52. Springer, Berlin/Heidelberg (2007)
Bordenave, C., McDonald, D., Proutiere, A.: A particle system in interaction with a rapidly varying environment: mean field limits and applications. AMS J. Netw. Heterog. Media (2010). doi:10.3934/nhm.2010.5.31
Borst, S., Proutiere, A., Hegde, N.: Capacity of wireless data networks with intra- and inter-cell mobility. In: Proceedings of IEEE INFOCOM, Barcelona, Spain (2006)
Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5, 49–77 (1995)
Ethier, S., Kurtz, T.: Markov Processes. Wiley, New York (1986)
Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Trans. Algorithms 3(3) (2007). doi:10.1145/1273340.1273348
Feldmann, R., Gairing, M., Lucking, T., Monien, F.B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP) (2003). doi:10.1007/3-540-45061-0_42
Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 131–140 (2004)
Graham, C.: Chaoticity on path space for a queueing network with selection of the shortest queue among several. J. Appl. Probab. 37, 198–211 (2000)
Harchol-Balter, M.: Task assignment with unknown duration. J. ACM 49(2), 260–288 (2002)
Key, P., Massoulie, L., Towsley, D.: Path selection and multipath congestion control. In: Proceedings of IEEE INFOCOM (2006)
Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 404–413 (1999)
Mitzenmacher, M.: The power of two choices in randomized load balancing. Ph.D. Thesis, University of California Berkeley (1996)
Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi-user communication networks. IEEE/ACM Trans. Netw. 1, 510–521 (1993)
Robert, P.: Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series. Springer, New York (2003)
Simatos, F., Tibi, D.: Spatial homogenization in a stochastic network with mobility. Ann. Appl. Probab. 20(1), 312–355 (2010)
Sznitman, A.: Propagation of chaos. In: Ecole d’ete de probabilites de Saint Flour XIX. Lectures Notes in Mathematics, vol. 1464, pp. 165–251. Springer, Berlin (1991)
Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Pereda. Inf. 32(1), 20–34 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ganesh, A., Lilienthal, S., Manjunath, D. et al. Load balancing via random local search in closed and open systems. Queueing Syst 71, 321–345 (2012). https://doi.org/10.1007/s11134-012-9315-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9315-9