Abstract
We examine heterogeneous M/M/c/K server clusters with various load balancing policies. We provide a mathematical framework that allows the efficient computation of the mean system time of jobs in the stationary mean-field limit that allows to find optimal load balancing prioritization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Load balancing mean-field optimizer. https://github.com/mezsimarci/lbmfcodes. Accessed 24 Apr 2024
Antal Horváth, I., Scully, Z., Van Houdt, B.: Mean field analysis of join-below-threshold load balancing for resource sharing servers. SIGMETRICS Perform. Eval. Rev. 48(1), 41–42 (2020)
Benaïm, M., Le Boudec, J.-Y.: A class of mean field interaction models for computer and communication systems. Performance Eval. 65(11), 823–838 (2008). Performance Evaluation Methodologies and Tools: Selected Papers from ValueTools 2007
Bhambay, S., Mukhopadhyay, A.: Asymptotic optimality of speed-aware jsq for heterogeneous service systems. Perform. Eval. 157–158, 102320 (2022)
Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley (2005)
Gast, N., Gaujal, B.: Markov chains with discontinuous drifts have differential inclusion limits. Performance Eval. 69, 623–642 (2012)
Horvath, I., Meszaros,, M.: Mean-field analysis of load balancing principles in large scale systems. https://arxiv.org/abs/2307.04360 (2023)
Kurtz, T.: Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probability 7, 49–58 (1970)
Kurtz, T.G.: Strong approximation theorems for density dependent Markov chains. Stochastic Processes Appl. 6(3), 223–240 (1978)
Lin, H.-C., Raghavendra, C.S.: Approximating the mean response time of parallel queues with JSQ policy. Comput. Oper. Res. 23(8), 733–740 (1996)
Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12, 1094–1104 (2001)
Mitzenmacher, M.: Analyzing distributed join-idle-queue: a fluid limit approach. In 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 312–318, September 2016
Roth, G., Sandholm, W.H.: Stochastic approximations with constant step size and differential inclusions. SIAM J. Control. Optim. 51(1), 525–555 (2013)
Tsitsiklis, J.N., Xu, K.: On the power of (even a little) centralization in distributed processing. In: Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2011, pp. 161–172. Association for Computing Machinery, New York (2011)
Acknowledgments
I. Horváth was supported by the OTKA K-138208 project of the Hungarian Scientific Research Fund.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Horváth, I., Mészáros, M. (2025). Analysis of Load Balancing Prioritization for Heterogeneous M/M/c/K Server Clusters in the Stationary Mean-Field Regime. In: Devos, A., Horváth, A., Rossi, S. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2024. Lecture Notes in Computer Science, vol 14826. Springer, Cham. https://doi.org/10.1007/978-3-031-70753-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-70753-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-70752-0
Online ISBN: 978-3-031-70753-7
eBook Packages: Computer ScienceComputer Science (R0)