Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-04T18:51:50.784Z Has data issue: false hasContentIssue false
  • English
  • Français

Universality of load balancing schemes on the diffusion scale

Part of: Computer system organization Operations research and management science Special processes

Published online by Cambridge University Press:  09 December 2016

Debankur Mukherjee ,
Sem C. Borst ,
Johan S. H. van Leeuwaarden  and
Philip A. Whiting
Debankur Mukherjee*
Affiliation:
Eindhoven University of Technology
Sem C. Borst*
Affiliation:
Eindhoven University of Technology and Nokia Bell Labs
Johan S. H. van Leeuwaarden*
Affiliation:
Eindhoven University of Technology
Philip A. Whiting*
Affiliation:
Macquarie University
*
* Postal address: Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, Netherlands.
* Postal address: Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, Netherlands.
* Postal address: Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, Netherlands.
*** Postal address: Department of Engineering, Macquarie University, North Ryde, NSW 2109, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a system of N parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among d randomly selected servers otherwise (1≤d≤N). This load balancing scheme subsumes the so-called join-the-idle queue policy (d=1) and the celebrated join-the-shortest queue policy (d=N) as two crucial special cases. We develop a stochastic coupling construction to obtain the diffusion limit of the queue process in the Halfin‒Whitt heavy-traffic regime, and establish that it does not depend on the value of d, implying that assigning tasks to idle servers is sufficient for diffusion level optimality.

Keywords

Join-the-idle-queue policyjoin-the-shortest-queue policyload balancingpower of tworouteingsample path comparisonstochastic couplingsupermarket model

MSC classification

Primary: 60K25: Queueing theory 68M20: Performance evaluation; queueing; scheduling
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) 90B18: Communication networks 90B36: Scheduling theory, stochastic
Type
Research Papers
Information
Journal of Applied Probability , Volume 53 , Issue 4 , December 2016 , pp. 1111 - 1124
Copyright
Copyright © Applied Probability Trust 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Badonnel, R.and Burgess, M. (2008).Dynamic pull-based load balancing for autonomic servers. In Network Operations and Management Symposium, NOMS 2008, pp. 751–754.Google Scholar
[2] Bramson, M.,Lu, Y. and Prabhakar, B. (2012).Asymptotic independence of queues under randomized load balancing.Queueing Systems 71,247–292.Google Scholar
[3] Ephremides, A.,Varaiya, P. and Walrand, J. (1980).A simple dynamic routing problem.IEEE Trans. Automatic Control 25,690–693.Google Scholar
[4] Eschenfeldt, P. and Gamarnik, D. (2015).Join the shortest queue with many servers. The heavy traffic asymptotics. Preprint. Available athttps://arxiv.org/abs/1502.00999v2.Google Scholar
[5] Gupta, V.,Harchol-Balter, M.,Sigman, K. and Whitt, W. (2007).Analysis of join-the-shortest-queue routing for web server farms.Performance Evaluation 64,1062–1081.Google Scholar
[6] Halfin, S. and Whitt, W. (1981).Heavy-traffic limits for queues with many exponential servers.Operat. Res. 29,567–588.Google Scholar
[7] Jonckheere, M. (2006).Insensitive versus efficient dynamic load balancing in networks without blocking.Queueing Systems 54,193–202.Google Scholar
[8] Lu, Y. et al. (2011).Join-idle-queue: a novel load balancing algorithm for dynamically scalable web services.Performance Evaluation 68,1056–1071.Google Scholar
[9] Mitzenmacher, M. (2001).The power of two choices in randomized load balancing.IEEE Trans. Parallel Distributed Systems 12,1094–1104.Google Scholar
[10] Pang, G.,Talreja, R. and Whitt, W. (2007).Martingale proofs of many-server heavy-traffic limits for Markovian queues.Prob. Surveys 4,193–267.Google Scholar
[11] Sparaggis, P. D.,Towsley, D. and Cassandras, C. G. (1994).Sample path criteria for weak majorization.Adv. Appl. Prob. 26,155–171.Google Scholar
[12] Stolyar, A. L. (2015).Pull-based load distribution in large-scale heterogeneous service systems.Queueing Systems 80,341–361.Google Scholar
[13] Towsley, D. (1995).Application of majorization to control problems in queueing systems. In Scheduling Theory and Its Applications, eds P. Chrétienne et al.,John Wiley,Chichester.Google Scholar
[14] Towsley, D.,Sparaggis, P. D. and Cassandras, C. G. (1992).Optimal routing and buffer allocation for a class of finite capacity queueing systems.IEEE Trans. Automatic Control 37,1446–1451.Google Scholar
[15] Vvedenskaya, N. D.,Dobrushin, R. L. and Karpelevich, F. I. (1996).Queueing system with selection of the shortest of two queues: an asymptotic approach.Prob. Peredachi Inf. 32,20–34.Google Scholar
[16] Weber, R. R. (1978).On the optimal assignment of customers to parallel servers.J. Appl. Prob. 15,406–413.Google Scholar
[17] Whitt, W. (1986).Deciding which queue to join: some counterexamples.Operat. Res. 34,55–62.Google Scholar
[18] Winston, W. (1977).Optimality of the shortest line discipline.J. Appl. Prob. 14,181–189.Google Scholar