article

Free access

An approximation to the response time for shortest queue routing

Authors:

R. D. Nelson,

T. K. PhilipsAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 17, Issue 1

Pages 181 - 189

https://doi.org/10.1145/75372.75392

Published: 01 April 1989 Publication History

PDF eReader

Abstract

In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for Κ ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For Κ = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.

References

[1]

Blanc, J.P.C., A Note on Waiting Times in Systems with Queues in Parallel, j. Appl. Prob. Vol. 24, 540-546, 1987.

Crossref

Google Scholar

[2]

Cohen, J.W. and Boxma, O.J., Boundary Value Problems in Queueing System Analysis, North Holland, 1983.

Google Scholar

[3]

Conolly, B.W., The Autostrada Queueing Problem, J. Aonl. Prob.: Vol. 21. 394-403, 1984.

Crossref

Google Scholar

[4]

Ephremides, A., Varaiya, P., and Walrand, J., A simple Dynamic Routing Problem, IEEE Transaction on Automatic Control, Vol. AC-25, No. 4, 690-693, August 1980.

Crossref

Google Scholar

[5]

Flatto, L. and McKean, H.P., Two Queues in Parallel Communication on Pure and Applied Mathematics, Vol. 30, 255-263, 1977.

Crossref

Google Scholar

[6]

Foschini, G. and Salz, J., A Basic Dynamic Routing Problem and Diffusion, IEEE Transactions on Communications, Vol. Com-26, No. 3, March 1978.

Google Scholar

[7]

Gubner, J.A., Gopinath, B. and Varadhan, S.R.S., Bounding Functions of Markov Processes and the Shortest Queue Problem, Preprint, University of Maryland, 1988.

Google Scholar

[8]

Halfin, S., The Shortest Queue Problem, J. Appl. Prob. Vol. 22, 865-878, 1985.

Crossref

Google Scholar

[9]

Kingman, J.F.C., Two Similar Queues in Parallel Biometrika, Vol. 48, 1316-1323, 1961.

Google Scholar

[10]

Knessl, C., Matkowsky, B.J., Schuss, Z., and Tier, C., Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content, IEEE Transactions on Communications, Vol. Com-35, No. 11,1153-1158, 1987.

Google Scholar

[11]

Lavenberg, S.S., Computer Performance Modeling Handbook, Academic Press, 1983.

Digital Library

Google Scholar

[12]

Nelson, R. and Tantawi, A., Approximate Analysis of Fork/Join Synchronization in Parallel Queues, IEEE Transactions on Computers, Vol. 37, No 6, June 1988.

Digital Library

Google Scholar

[13]

Rao, B.M. and Posner, M.J.M., Algorithmic and Approximate Analysis of the Shorter Queue Model Naval Research Logistics, Vol. 34, 381-398, 1987.

Google Scholar

[14]

Winston, W., Optimality of the Shortest Line Discipline, J. Appl. Prob. Vol. 14, 181-189, 1977.

Crossref

Google Scholar

Cited By

View all

Campello FIngolfsson AShumsky R(2017)Queueing Models of Case ManagersManagement Science10.1287/mnsc.2015.236863:3(882-900)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1287/mnsc.2015.2368
Hyytiä ERighter RSamúelsson S(2017)Beyond Shortest Queue Routing with Heterogeneous Servers and General Cost FunctionsProceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3150928.3150946(206-213)Online publication date: 5-Dec-2017
https://dl.acm.org/doi/10.1145/3150928.3150946
Xu SZhao Y(2016)Dynamic routing and jockeying controls in a two-station queueing systemAdvances in Applied Probability10.2307/142817028:04(1201-1226)Online publication date: 1-Jul-2016
https://doi.org/10.2307/1428170
Show More Cited By

Index Terms

An approximation to the response time for shortest queue routing

Recommendations

Stationary analysis of the shortest queue first service policy

We analyze the so-called shortest queue first (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time, the queue with the smallest workload. Considering a stationary system composed of two parallel queues ...
Decay rate for a PH/M/2 queue with shortest queue discipline

In this paper, we consider a PH/M /2 queue in which each server has its own queue and arriving customers join the shortest queue. For this model, it has been conjectured that the decay rate of the tail probabilities for the shortest queue length in the ...
Analysis of join-the-shortest-queue routing for web server farms

Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, whereas it is known that web server farms are better modeled as Processor ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 17, Issue 1

May 1989

209 pages

ISSN:0163-5999

DOI:10.1145/75372

Editor:
Blaine D. Gaither
Gould Inc., San Diego, CA

Issue’s Table of Contents

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
April 1989
242 pages
ISBN:0897913159
DOI:10.1145/75108
Chairman:
Domenico Ferrari
Univ. of California, Berkeley

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Published in SIGMETRICS Volume 17, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
731
Total Downloads

Downloads (Last 12 months)83
Downloads (Last 6 weeks)12

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Campello FIngolfsson AShumsky R(2017)Queueing Models of Case ManagersManagement Science10.1287/mnsc.2015.236863:3(882-900)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1287/mnsc.2015.2368
Hyytiä ERighter RSamúelsson S(2017)Beyond Shortest Queue Routing with Heterogeneous Servers and General Cost FunctionsProceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3150928.3150946(206-213)Online publication date: 5-Dec-2017
https://dl.acm.org/doi/10.1145/3150928.3150946
Xu SZhao Y(2016)Dynamic routing and jockeying controls in a two-station queueing systemAdvances in Applied Probability10.2307/142817028:04(1201-1226)Online publication date: 1-Jul-2016
https://doi.org/10.2307/1428170
Xu SZhao Y(2016)Dynamic routing and jockeying controls in a two-station queueing systemAdvances in Applied Probability10.1017/S000186780002761028:04(1201-1226)Online publication date: 1-Jul-2016
https://doi.org/10.1017/S0001867800027610
Zhang ZDaigle J(2012)Analysis of job assignment with batch arrivals among heterogeneous serversEuropean Journal of Operational Research10.1016/j.ejor.2011.09.001217:1(149-161)Online publication date: Feb-2012
https://doi.org/10.1016/j.ejor.2011.09.001
Kargahi MMovaghar A(2010)Utility Accrual Dynamic Routing in Real-Time Parallel SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2010.5021:12(1822-1835)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1109/TPDS.2010.50
Bjorkqvist MChen LBinder W(2010)Load-Balancing Dynamic Service Binding in Composition Execution EnginesProceedings of the 2010 IEEE Asia-Pacific Services Computing Conference10.1109/APSCC.2010.86(67-74)Online publication date: 6-Dec-2010
https://dl.acm.org/doi/10.1109/APSCC.2010.86
Bachmat ESarfati H(2010)Analysis of SITA policiesPerformance Evaluation10.1016/j.peva.2009.09.00767:2(102-120)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.peva.2009.09.007
Kargahi MMovaghar A(2010)Dynamic routing of real-time jobs among parallel EDF queuesComputers and Electrical Engineering10.1016/j.compeleceng.2008.04.00436:5(835-849)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.compeleceng.2008.04.004
Khodadadi SRazmi J(2010)A Threshold Based Dynamic Routing for Jobs with QoS RankingBalanced Automation Systems for Future Manufacturing Networks10.1007/978-3-642-14341-0_16(137-144)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14341-0_16
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Stationary analysis of the shortest queue first service policy

Decay rate for a PH/M/2 queue with shortest queue discipline

Analysis of join-the-shortest-queue routing for web server farms

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations