Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T22:36:18.750Z Has data issue: false hasContentIssue false

Minimizing response times and queue lengths in systems of parallel queues

Published online by Cambridge University Press:  14 July 2016

Ger Koole*
Affiliation:
Vrije Universiteit
Panayotis D. Sparaggis*
Affiliation:
University of Massachusetts
Don Towsley*
Affiliation:
University of Massachusetts
*
∗ Postal address: Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands.
∗∗ Postal address: Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003–4610, USA.
∗∗∗ Postal address: Department of Computer Science, University of Massachusetts, Amherst, MA 01003–4610, USA. Email address: towsley@ca.umass.edu

Abstract

We consider the problem of routeing customers to one of two parallel queues. Arrivals are independent of the state of the system but otherwise arbitrary. Assuming that queues have infinite capacities and the service times form a sequence of i.i.d. random variables with increasing likelihood ratio (ILR) distribution, we prove that the shortest queue (SQ) policy minimizes various cost functionals related to queue lengths and response times. We give a counterexample which shows that this result is not generally true when the service times have increasing hazard rate but are not increasing in the likelihood rate sense. Finally, we show that when capacities are finite the SQ policy stochastically maximizes the departure process and minimizes the loss counting process.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1999 

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.)

Article purchase

Temporarily unavailable