Hostname: page-component-5cf477f64f-qls9x Total loading time: 0 Render date: 2025-04-05T23:03:29.022Z Has data issue: false hasContentIssue false
  • English
  • Français

Finite queues in parallel under a generalized channel selection rule

Published online by Cambridge University Press:  14 July 2016

William K. Hall  and
Ralph L. Disney
William K. Hall
Affiliation:
University of Michigan
Ralph L. Disney
Affiliation:
University of Michigan
Get access Rights & Permissions [Opens in a new window]

Extract

Consider a queueing system of the following type: random arrivals enter the system, where they are assigned to one of r service channels. Each arrival is then serviced and discharged from the system. The classical results for this class of problems are based upon systems where customers join a single queue and then are randomly assigned to an available server from this queue. (See, for instance, Takács (1962).)

Type
Short Communications
Information
Journal of Applied Probability , Volume 8 , Issue 2 , June 1971 , pp. 413 - 416
Copyright
Copyright © Applied Probability Trust 1971 

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

Çinlar, E. (1965) Analysis of Systems of Queues in Parallel. Ph.D. Thesis, University of Michigan.Google Scholar
Çinlar, E. (1967) Decomposition of a semi-Markov process under a state-dependent rule. SIAM J. Appl. Math. 15, 252–263.CrossRefGoogle Scholar
Çinlar, E. (1967) Queues with semi-Markovian arrivals. J. Appl. Prob. 4, 365–379.CrossRefGoogle Scholar
Haight, F. A. (1958) Two queues in parallel. Biometrika 45, 401–410.CrossRefGoogle Scholar
Kingman, J. F. C. (1961) Two similar queues in parallel. Ann. Math. Statist. 32, 1314–1323.CrossRefGoogle Scholar
Takács, L. (1962) An Introduction to Queueing Theory. Oxford University Press, New York.Google Scholar