Abstract
Queueing network models with finite capacity and blocking can be used to represent various systems with finite resources, including communication and computer systems, as well as production and manufacturing systems, to evaluate their performance. Various blocking types have been defined to represent various system behaviors. Queueing networks with blocking show a product-form solution under special constraints. We present a convolution algorithm for the class of product-form closed network models with blocking to evaluate queue length distribution and average performance indices. As a consequence, this class of networks can be analysed with a polynomial time computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I.F. Akyildiz and H. von Brand, Computational algorithms for networks of queues with rejection blocking, Acta Informatica 26(1989)559 - 576.
S. Balsamo and V. De Nitto Personè, Closed queueing networks with finite capacities: Blocking types, product-form solution and performance indices, Performance Evaluation 12(1991)85 - 102.
S. Balsamo and V. De Nitto Personè, A survey of product-form queueing networks with blocking and their equivalences, Annals of Operations Research 48(1994)31-61.
S. Balsamo, Properties and analysis of queueing network models with finite capacities, in: Performance Evaluation of Computer and Communication Systems, Lecture Notes in Computer Science 729, Springer, 1994.
F. Baskett, K.M. Chandy, R.R. Muntz and G. Palacios, Open, closed, and mixed networks of queues with different classes of customers J. ACM 22(1985)248 - 260.
J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM 16(1973)527 - 531.
M.C. Clò, MVA for product-form cyclic queueing networks with RS blocking, Proc. 3rd International Workshop on Queueing Networks with Finite Capacity, Bradford, UK, Annals of Operations Research (1998), this volume.
H. Daduna, Busy periods for subnetworks in stochastic networks: Mean value analysis, J. ACM 35(1988)668 - 674.
W.J. Gordon and G.F. Newell, Cyclic queueing systems with restricted queues, Oper. Res. 15(1976) 286 - 302.
A. Hordijk and N. van Dijk, Networks of queues with blocking, in: Performance '81, ed. K.J. Kylstra, North-Holland, 1981, pp. 51 - 65.
F.P. Kelly, Reversibility and Stochastic NetworksWiley, 1979.
S.S. Lavenberg, Computer Performance Modelling Handbook, Academic Press, New York, 1983.
R.A. Marie, An approximate analytical method for general queueing networks, IEEE Trans. Softw. Eng. SE-5(1979)530 - 538.
R.D. Nelson, The mathematics of product-form queueing networks, ACM Computing Surveys 25(1993).
R.O. Onvural, Survey of closed queueing networks with blocking, ACM Computing Surveys 22 (1990)83 - 121.
H. Perros, Queueing Networks with Blocking, Oxford, 1994.
M. Reiser and M. Kobayashi, Queueing networks with multiple closed chains: Theory and computational algorithms, IBM J. Res. and Develop 19(1975)238 - 294.
M. Reiser and S.S. Lavenberg, Mean value analysis of closed multichain queueing networks, J. ACM 27(1980)313 - 322.
N. van Dijk, On “stop = repeat” servicing for non-exponential queueing networks with blocking, J. Appl. Prob. 28(1991)159-173.
N. van Dijk, “Stop = recirculate” for exponential product form queueing networks with departure blocking, Oper. Res. Lett. 10(1991)343-351.
Rights and permissions
About this article
Cite this article
Balsamo, S., Clò, M. A convolution algorithm for product-form queueing networks with blocking. Annals of Operations Research 79, 97–117 (1998). https://doi.org/10.1023/A:1018947410914
Issue Date:
DOI: https://doi.org/10.1023/A:1018947410914