Abstract
We propose a new method for the performance evaluation of Open Queueing Networks with a Population Constraint (represented by a set of tokens). The method is based on the application of Approximate Mean Value Analysis (AMVA) algorithms. We present procedures for single class networks and for multiple class networks, subject to either a common constraint (shared tokens) or to class‐based constraints (dedicated tokens). In fact, the new method is a unified framework into which all procedures for the different types of networks fit. We show how the new method relates to well‐known methods and present some numerical results to indicate its accuracy.
Similar content being viewed by others
References
B. Avi-Itzhak and D.P. Heyman, Approximate queuing models for multiprogramming computer systems,Operations Research 21 (1973) 1212–1230.
B. Baynat and Y. Dallery, A product-form approximation method for general closed queueing networks with several classes of customers, Performance Evaluation 24 (1996) 165–188.
A. Brandwajn, Fast approximate solution of multiprogramming models, in: Performance Evaluation Review (1982) pp. 141–149.
M.B.N. Bui, D´efinition d'un outil de modelisation experte, Ph.D. thesis, Universit´e de Pierre et Marie Curie (1989).
R. Buitenhek, Performance evaluation of dual resource manufacturing systems, Ph.D. thesis, University of Twente (1998).
R. Buitenhek, G.J. van Houtum and W.H.M. Zijm, An open queueing model for flexible manufacturing systems with multiple part types and general purpose pallets, Working paper LPOM–96–11, Faculty of Mechanical Engineering, University of Twente (1996).
J.A. Buzacott and J.G. Shanthikumar, Models for understanding flexible manufacturing systems, AIIE Transactions 12 (1980) 339–350.
J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems (Prentice Hall, 1993).
K.M. Chandy, U. Herzog and L. Woo, Approximate analysis of queueing networks, IBM Journal of Research and Development 19 (1975) 43–49.
K.M. Chandy, U. Herzog and L. Woo, Parametric analysis of queueing networks, IBM Journal of Research and Development 19 (1975) 36–42.
Y. Dallery, Approximate analysis of general open queueing networks with restricted capacity, Performance Evaluation 11 (1990) 209–222.
E.D. Lazowska and J. Zahorjan, Multiple class memory constrained queueing networks, in: Performance Evaluation Review (1982) pp. 130–140.
R. Marie, An approximate method for general queueing networks, IEEE Transactions on Software Engineering 5 (1979) 530–538.
M. Neuts, Matrix-Geometric Solutions in Stochastic Models-An Algorithmic Approach (The John Hopkins University Press, 1981).
H.G. Perros, Y. Dallery and G. Pujolle, Analysis of a queueing network model with class dependent window flow control, IEEE InfoCom (1992) pp. 968–977.
M. Reiser and S.S. Lavenberg, Mean-value analysis of closed multichain queueing networks, Journal of the Association for Computing Machinery 27 (1980) 313–322.
L.P. Seelen, An algorithm for PHPHc queues, European Journal of Operational Research 23 (1986) 118–127.
M.L. Spearman, D.L. Woodruff and W.J. Hopp, CONWIP: A pull alternative to kanban, International Journal of Production Research 28 (1990) 879–894.
U. Sumita and M. Rieders, Numerical comparison of the replacement process approach with the aggregation-disaggregation algorithm for row-continuous Markov chains, in: Numerical Solution of Markov Chains, ed. W.J. Stewart (Marcel Dekker, 1991) pp. 287–302.
A. Thomasian and P. Bay, Analysis of queueing network models with population size constraints and delayed blocked customers, in: Proceedings of the ACM SIGMETRICS Conference (Cambridge, 1984) pp. 202–216.
H.C. Tijms, Stochastic Modelling and Analysis: A Computational Approach (Wiley, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buitenhek, R., van Houtum, G. & Zijm, H. AMVA‐based solution procedures for open queueing networks with population constraints. Annals of Operations Research 93, 15–40 (2000). https://doi.org/10.1023/A:1018967622069
Issue Date:
DOI: https://doi.org/10.1023/A:1018967622069