Abstract
This paper will show how to solve simple closed queueing network models using spreadsheets. Over the past decade there has been a growth in the use of personal computers and spreadsheets on the one hand and a growth in the use of approximate solution methods on the other. This paper will show that it is possible to use spreadsheets to re-create well known fixed point or approximate Mean Value Analysis results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lavenberg S.S. Closed multichain product form queueing networks with large population sizes. In: Disney R L, Ott T J, (eds) Applied Probability. Vol.l. Birkhauser; 1981, pp 219–249.
Lavenberg S. S. and Reiser M. Stationery state probabilities at arrival instants for closed queueing networks with multiple types of customers. Journal of Applied Probability. Vol. 17; 1980, pp 1048–1061.
Sevcik K. C. and Mitrani I. The distribution of queueing network states at input and output instants. Journal of the ACM. 28; 1981, pp 358–371.
Chandy K. M. and Neuse D. Fast accurate heuristic algorithms for queueing network models of computing systems. Communications of the ACM 25,2; Feb. 1982, pp 126–134.
van Doremalen J., Wessels J. and Wijbrands R. Approximate Analysis of Priority Queueing Networks. Teletraffic Analysis and Computer Performance Evaluation. Science; 1986, pp 117–131.
Zahorjan J., Eager D. L. and Sweillam H. M. Accuracy, Speed, and Convergence of Approximate Mean Value Analysis. Performance Evaluation 8; 1988, pp 255–270.
Agrawal S. C. Metamodelling. MIT Press, 1984.
Bondi A. B. and Chuang Y-M. A New MVA-Based Approximation for Queueing Networks with a Preemptive Priority Server. Performance Evaluation 8; 1988, pp 195–221.
Eager D. L. and Lipscomb J. N. The AMVA Priority Approximation. Performance Evaluation 8; 1988, pp 173–193.
Kaufman J. S. Approximation methods for networks of queues with priorities. Performance Evaluation 4; 1984, pp 183–198.
Kouvatsos D. and Tabet-Aouel N. Personal communication. 1989.
Kelly F. P. On a Class of Approximations For Closed Queuing Networks. Queuing Systems: Theory and Applications. 1988
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Thomas, D.L.L. (1992). Experiences in Implementing Solution Techniques for Networks of Queues. In: Hillston, J.E., King, P.J.B., Pooley, R.J. (eds) 7th UK Computer and Telecommunications Performance Engineering Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3538-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3538-8_6
Publisher Name: Springer, London
Print ISBN: 978-3-540-19733-1
Online ISBN: 978-1-4471-3538-8
eBook Packages: Springer Book Archive