Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-67gxp Total loading time: 0.306 Render date: 2021-03-06T00:01:10.314Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
Journal of Applied Probability Journal of Applied Probability

Article contents

Universality of load balancing schemes on the diffusion scale

Part of: Operations research and management science Computer system organization 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
Corresponding
E-mail address:
d.mukherjee@tue.nl
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 policy join-the-shortest-queue policy load balancing power of two routeing sample path comparison stochastic coupling supermarket 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.
If you should have access and can't see this content please contact technical support.

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.CrossRefGoogle Scholar
[3] Ephremides, A.,Varaiya, P. and Walrand, J. (1980).A simple dynamic routing problem.IEEE Trans. Automatic Control 25,690–693.CrossRefGoogle 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.CrossRefGoogle Scholar
[6] Halfin, S. and Whitt, W. (1981).Heavy-traffic limits for queues with many exponential servers.Operat. Res. 29,567–588.CrossRefGoogle Scholar
[7] Jonckheere, M. (2006).Insensitive versus efficient dynamic load balancing in networks without blocking.Queueing Systems 54,193–202.CrossRefGoogle 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.CrossRefGoogle Scholar
[9] Mitzenmacher, M. (2001).The power of two choices in randomized load balancing.IEEE Trans. Parallel Distributed Systems 12,1094–1104.CrossRefGoogle 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.CrossRefGoogle Scholar
[11] Sparaggis, P. D.,Towsley, D. and Cassandras, C. G. (1994).Sample path criteria for weak majorization.Adv. Appl. Prob. 26,155–171.CrossRefGoogle Scholar
[12] Stolyar, A. L. (2015).Pull-based load distribution in large-scale heterogeneous service systems.Queueing Systems 80,341–361.CrossRefGoogle 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.CrossRefGoogle 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.CrossRefGoogle Scholar
[17] Whitt, W. (1986).Deciding which queue to join: some counterexamples.Operat. Res. 34,55–62.CrossRefGoogle Scholar
[18] Winston, W. (1977).Optimality of the shortest line discipline.J. Appl. Prob. 14,181–189.CrossRefGoogle Scholar

Altmetric attention score

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 112 *
View data table for this chart

* Views captured on Cambridge Core between 09th December 2016 - 6th March 2021. This data will be updated every 24 hours.

17 Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Universality of load balancing schemes on the diffusion scale
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Universality of load balancing schemes on the diffusion scale
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Universality of load balancing schemes on the diffusion scale
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *