Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-30T05:26:41.690Z Has data issue: false hasContentIssue false
  • English
  • Français

Networks of queues with customers of different types

Published online by Cambridge University Press:  14 July 2016

F. P. Kelly
F. P. Kelly*
Affiliation:
University of Cambridge
Get access Rights & Permissions [Opens in a new window]

Abstract

The behaviour in equilibrium of networks of queues in which customers may be of different types is studied. The type of a customer is allowed to influence his choice of path through the network and, under certain conditions, his service time distribution at each queue. The model assumed will usually cause each service time distribution to be of a form related to the negative exponential distribution.

Theorems 1 and 2 establish the equilibrium distribution for the basic model in the closed and open cases; in the open case the individual queues are independent in equilibrium. In Section 4 similar results are obtained for other models, models which include processes better described as networks of colonies or as networks of stacks. In Section 5 the effect of time reversal upon certain processes is used to obtain further information about the equilibrium behaviour of those processes.

Keywords

NETWORK OF QUEUESDIFFERENT CUSTOMER TYPESMARKOV POPULATION PROCESSEQUILIBRIUM DISTRIBUTIONMIGRATION PROCESSTIME REVERSAL
Type
Research Papers
Information
Journal of Applied Probability , Volume 12 , Issue 3 , September 1975 , pp. 542 - 554
Copyright
Copyright © Applied Probability Trust 1975 

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] Bartlett, M. S. (1949) Some evolutionary stochastic processes. J. R. Statist. Soc. B 11, 211–229.Google Scholar
[2] Collings, T. W. R. (1974) A queueing problem in which customers have different service distributions. Appl. Statist. 23, 75–82.Google Scholar
[3] Jackson, J. R. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
[4] Karlin, S. (1966) A First Course in Stochastic Processes. Academic Press, New York.Google Scholar
[5] Kendall, D. G. and Reuter, G. E. H. (1957) The calculation of the ergodic projection for Markov chains and processes with a countable infinity of states. Acta Math. 97, 103–143.Google Scholar
[6] Kendall, D. G. Markov Methods (to appear).Google Scholar
[7] Kingman, J. F. C. (1969) Markov population processes. J. Appl. Prob. 6, 1–18.Google Scholar
[8] Moran, P. A. P. (1968) An Introduction to Probability Theory. Clarendon Press, Oxford.Google Scholar
[9] Reich, E. (1957) Waiting times when queues are in tandem. Ann. Math. Statist. 28, 768–773.Google Scholar
[10] Whittle, P. (1967) Nonlinear migration processes. Proc. 36th Session of the International Statistical Institute.Google Scholar
[11] Whittle, P. (1968) Equilibrium distributions for an open migration process. J. Appl. Prob. 5, 567–571.Google Scholar