Experiences in Implementing Solution Techniques for Networks of Queues

  • David L. L. Thomas
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

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.

Keywords

Kelly 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.Google Scholar
  2. [2]
    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.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    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.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.MATHCrossRefGoogle Scholar
  7. [7]
    Agrawal S. C. Metamodelling. MIT Press, 1984.Google Scholar
  8. [8]
    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.MATHCrossRefGoogle Scholar
  9. [9]
    Eager D. L. and Lipscomb J. N. The AMVA Priority Approximation. Performance Evaluation 8; 1988, pp 173–193.MATHCrossRefGoogle Scholar
  10. [10]
    Kaufman J. S. Approximation methods for networks of queues with priorities. Performance Evaluation 4; 1984, pp 183–198.MathSciNetCrossRefGoogle Scholar
  11. [11]
    Kouvatsos D. and Tabet-Aouel N. Personal communication. 1989.Google Scholar
  12. [12]
    Kelly F. P. On a Class of Approximations For Closed Queuing Networks. Queuing Systems: Theory and Applications. 1988Google Scholar

Copyright information

© Springer-Verlag London 1992

Authors and Affiliations

  • David L. L. Thomas
    • 1
  1. 1.British Telecom ComputerPerformance Management GroupCardiffUSA

Personalised recommendations