Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-07T13:24:14.529Z Has data issue: false hasContentIssue false
  • English
  • Français

Discrete-time queueing networks with geometric release probabilities

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  01 July 2016

W. Henderson  and
P. G. Taylor
W. Henderson
Affiliation:
University of Adelaide
P. G. Taylor
Affiliation:
University of Adelaide
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This note is concerned with the continuing misconception that a discrete-time network of queues, with independent customer routing and the number of arrivals and services in a time interval following geometric and truncated geometric distributions respectively, has a product-form equilibrium distribution.

Keywords

DISCRETE-TIME QUEUEING NETWORKEXTENDED BERNOULLI QUEUESGEOMETRIC RELEASE PROBABILITIESPRODUCT FORM

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) 90B22: Queues and service

Information

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 24 , Issue 1 , March 1992 , pp. 229 - 233
Copyright
Copyright © Applied Probability Trust 1992 

References

[1] Boucherie, R. J. and Van Dijk, N. M. (1991) Product forms for queueing networks with state dependent multiple job transitions. Adv. Appl. Prob. 23, 152–187.CrossRefGoogle Scholar
[2] 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
[3] Henderson, W. and Taylor, P. G. (1991) Some new results on queueing networks with batch movements. J. Appl. Prob. 28, 409–421.CrossRefGoogle Scholar
[4] Jackson, J. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.CrossRefGoogle Scholar
[5] Jackson, J. (1963) Jobshop-like queueing systems. Management Sci. 10, 131–142.CrossRefGoogle Scholar
[6] Pujolle, G. (1988) Multiclass discrete time queueing systems with a product form solution. Preprint, Laboratoire MASI, Université Pierre et Marie Curie, Paris.Google Scholar
[7] Pujolle, G. (1991) Discrete-time queueing systems for data networks performance evaluation. In Queueing Performance and Control in ATM (ITC-13) , ed. Cohen, J. W. and Pack, C. D. Elsevier Science Publishers (North-Holland), Amsterdam.Google Scholar
[8] Walrand, J. (1983) A discrete-time queueing network. J. Appl. Prob. 20, 903–909.CrossRefGoogle Scholar