Hostname: page-component-84b7d79bbc-rnpqb Total loading time: 0 Render date: 2024-07-28T09:28:28.584Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on waiting times in systems with queues in parallel

Published online by Cambridge University Press:  14 July 2016

J. P. C. Blanc
J. P. C. Blanc*
Affiliation:
Delft University of Technology
Get access Rights & Permissions [Opens in a new window]

Abstract

Numerical data are presented concerning the mean and the standard deviation of the waiting-time distribution for multiserver systems with queues in parallel, in which customers choose one of the shortest queues upon arrival. Moreover, a new numerical method is outlined for calculating state probabilities and moments of queue-length distributions. This method is based on power series expansions and recursion. It is applicable to many systems with more than one waiting line.

Keywords

POWER SERIES EXPANSIONS
Type
Short Communications
Information
Journal of Applied Probability , Volume 24 , Issue 2 , June 1987 , pp. 540 - 546
Copyright
Copyright © Applied Probability Trust 1987 

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] CoNolly, B. W. (1984) The autostrada queueing problem. J. Appl. Prob. 21, 394–403.CrossRefGoogle Scholar
[2] Kingman, J. F. C. (1961) Two similar queues in parallel. Ann. Math. Statist. 32, 1314–1323.Google Scholar