Hostname: page-component-6898cfcb55-cbk24 Total loading time: 0 Render date: 2026-11-11T11:05:41.845Z Has data issue: false hasContentIssue false
  • English
  • Français

Some new results on queueing networks with batch movement

Published online by Cambridge University Press:  14 July 2016

W. Henderson and
P. G. Taylor
W. Henderson*
Affiliation:
University of Adelaide
P. G. Taylor*
Affiliation:
University of Western Australia
*
∗Postal address: Department of Applied Mathematics, University of Adelaide, GPO Box 498, Adelaide, SA 5001, Australia.
∗∗Postal address: Department of Mathematics, University of Western Australia, Nedlands, WA 6009, Australia.
Get accessRights & Permissions [Opens in a new window]

Abstract

Product-form equilibrium distributions in networks of queues in which customers move singly have been known since 1957, when Jackson derived some surprising independence results. A product-form equilibrium distribution has also recently been shown to be valid for certain queueing networks with batch arrivals, batch services and even correlated routing.

This paper derives the joint equilibrium distribution of states immediately before and after a batch of customers is released into the network. The results are valid for either discrete- or continuous-time queueing networks: previously obtained results can be seen as marginal distributions within a more general framework. A generalisation of the classical ‘arrival theorem' for continuous-time networks is given, which compares the equilibrium distribution as seen by arrivals to the time-averaged equilibrium distribution.

Keywords

CORRELATED ROUTINGPRODUCT FORM

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 2 , June 1991, pp. 409 - 421
Copyright
Copyright © Applied Probability Trust 1991 

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

References

[1]Bharath-Kumar, K. (1980) Discrete time queueing systems and their networks. IEEE Trans. Commun. 28, 260–263.Google Scholar
[2]Baskett, F., Chandy, K., Muntz, R. and Palacios, J. (1975) Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comp. Math. 22, 248–260.Google Scholar
[3]Bruneel, H. (1983) Comments on ‘discrete time queueing systems and their networks’. IEEE Trans. Commun. 31, 461–463.Google Scholar
[4]Bruneel, H. (1987) On discrete buffers in a two state environment. IEEE Trans. Commun. 35, 32–38.Google Scholar
[5]Boucherie, R. J. and Van Dijk, N. M. (1990) Spatial birth-death processes with multiple changes and applications to batch service networks and chustering processes. Adv. Appl. Prob. 22, 433–455.Google Scholar
[6]Cohen, J. W. (1957) The generalized Engset formulae. Philips Telecom. Review 18, 158–170.Google Scholar
[7]Descloux, (1976) On the validity of a particular subscriber's point of view. Proc. 5th Internat. Teletraffic Congr., New York.Google Scholar
[8]Henderson, W. and Taylor, P. G. (1990) Product form in networks of queues with batch arrivals and batch services. QUESTA 6, 71–88.Google Scholar
[9]Henderson, W., Lucic, D. and Taylor, P. G. (1989) A net level analysis of stochastic Petri nets with conflict sets. J. Austral. Math. Soc. B31.Google Scholar
[10]Henderson, W., Pearce, C. E. M., Taylor, P. G. and Van Dijk, N. M. (1990) Closed queueing networks with batch services. QUESTA 6, 59–70.Google Scholar
[11]Hsu, J. and Burke, P. J. (1976) Behaviour of tandem buffers with geometric input and Markovian output. IEEE. Trans. Commun. 24, 358–360.Google Scholar
[12]Jackson, J. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
[13]Jackson, J. (1963) Jobshop-like queueing systems. Management Sci. 10, 131–142.Google Scholar
[14]Kelly, F. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.Google Scholar
[15]Kelly, F. (1979) Reversibility and Stochastic Networks. Wiley, London.Google Scholar
[16]Kelly, F. and Pollett, P. (1981) Sojourn times in closed queueing networks. Adv. Appl. Prob. 15, 638–656.Google Scholar
[17]Pujolle, G. (1988) On discrete time queueing systems. Preprint, Department of Computer Science, North Carolina State University.Google Scholar
[18]Pujolle, G. (1988) Multiclass discrete time queueing systems with a product form solution. Preprint, Laboratoire MASI, Université Pierre et Marie Curie, Paris.Google Scholar
[19]Walrand, J. (1983) A discrete-time queueing network. J. Appl. Prob. 20, 903–909.Google Scholar
[20]Walrand, J. (1988) An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ.Google Scholar