Archive

Volume 3, Number 3 / June issue 2017
Manuel Alberto M. Ferreira
An infinite servers queue systems simulation applied to the respective busy period time length distribution and parameters study
Abstract

A FORTRAN program to simulate the operation of infinite servers’ queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there are not theoretical results or, existing, they are mathematically intractable what makes their utility doubtful. In this case a possible issue is to use simulation methods in order to get more useful results. In fact, using simulation, some experiences may be performed and the respective results used to conjecture about certain queue systems interesting quantities. In this paper this procedure is followed to learn something more about quantities of interest for those infinite server’s queue systems, in particular about busy period parameters and probability distributions.
Keywords: Infinite servers, queue, Poisson arrivals, simulation, busy period

Cite this article:
Manuel Alberto M. Ferreira. An infinite servers queue systems simulation applied to the respective busy period time length distribution and parameters study. Acta Scientiae et Intellectus, 3(3)2017, 36-51.


REFERENCES

  1. Andrade, M. (2010). A Note on Foundations of Probability.Journal of Mathematics and Technology, vol.. 1, No 1, pp 96-98.
  2. Carrillo, M.J. (1991). Extensions of Palm’s Theorem: A Review. Management Science, Vol. 37, No 6, pp. 739-744.
  3. Ferreira, M.A.M. (1994). Simulação de variáveis aleatórias – Método de Monte Carlo. Revista Portuguesa de Gestão, I (III/IV), pp. 119-127.
  4. Ferreira, M.A.M. (1998). Application of Ricatti Equation to the Busy Period Study of the M/G/∞ System. Statistical Review, 1st Quadrimester, INE, pp. 23-28.
  5. Ferreira, M.A.M. (1998a). Computational Simulation of Infinite Servers Systems. Statistical Review, 3rd Quadrimester, INE, pp. 5-28.
  6. Ferreira, M.A.M. (2001). M/G/∞ Queue Heavy-Traffic Situation Busy Period Distribution (Power and Pareto Service Distributions). Statistical Review, 1stQuadrimester, INE, pp. 27-36.
  7. Ferreira, M.A.M. (2002). The Exponentiality of the M/G/∞ Queue Busy Period. Actas das XII Jornadas Luso-Espanholas de Gestão Científica, Volume VIII- Economia da Empresa e Matemática Aplicada. UBI, Covilhã, Portugal, pp. 267-272.
  8. Ferreira, M.A.M. and Andrade, M. (2009). The Ties Between the M/G/∞ Queue System Transient Behaviour and the Busy Period. International Journal of Academic Research Vol. 1, No 1, pp. 84-92.
  9. Ferreira, M. A. M. and Andrade, M. (2010). Looking to a M/G/∞ system occupation through a Ricatti equation. Journal of Mathematics and Technology, Vol. 1, No 2, pp. 58-62.
  10. Ferreira, M. A. M. and Andrade, M. (2010a): M/G/∞ System Transient Behavior with Time Origin at the Beginning of a Busy Period Mean and Variance. Aplimat- Journal of Applied Mathematics, Vol. 3, No 3, pp. 213-221.
  11. Ferreira, M.A.M. and Andrade, M. (2010b). M/G/∞ Queue Busy Period Tail. Journal of Mathematics and Technology, Vol. 1, No 3, 11-16.
  12. Ferreira, M.A.M. and Andrade, M. (2011). Fundaments of Theory of Queues. International Journal of Academic Research, Vol. 3, No 1, part II, pp. 427-429.
  13. Ferreira, M.A.M. and Andrade, M. (2012). Busy Period and Busy Cycle Distributions and Parameters for a Particular M/G/∞ queue system. American Journal of Mathematics and Statistics, Vol. 2, No 2, pp. 10-15.
  14. Ferreira, M.A.M. and Andrade, M. (2013). Infinite Servers Queue Systems Computational Simulation. 12th Conference on Applied Mathematics, APLIMAT 2013, Proceedings. Bratislava 5th-7th February.
  15. Ferreira, M.A.M. and Ramalhoto M. F. (1994). Estudo dos parâmetros básicos do Período de Ocupação da Fila de Espera M/G/∞. A Estatística e o Futuro da Estatística. Actas do I Congresso Anual da S.P.E.. Edições Salamandra, Lisboa.
  16. Ferreira, M.A.M., Andrade, M. and Filipe, J.A. (2008). The Ricatti Equation in the M/G/∞ Busy Cycle Study. Journal of Mathematics, Statistics and Allied Fields Vol. 2, No 1.
  17. Ferreira, M.A.M., Andrade, M. and Filipe, J.A. (2009). Networks of Queues with Infinite Servers in Each Node Applied to the Management of a Two Echelons Repair System. China-USA Business Review Vol. 8, No 8, pp. 39-45 and 62.
  18. Figueira, J. and Ferreira, M.A.M. (1999). Representation of a Pensions Fund by a Stochastic Network with Two Nodes: An Exercise. Portuguese Revue of Financial Markets, Vol. I, No 3.
  19. Hershey, J.C., Weiss, E.N. and Morris, A.C. (1981). A Stochastic Service Network Model with Application to Hospital Facilities. Operations Research, Vol. 29, No 1, pp. 1-22.
  20. Kelly, F.P. (1979). Reversibility and Stochastic Networks. New York: John Wiley and Sons.
  21. Kendall and Stuart (1979). The Advanced Theory of Statistics. Distributions Theory. London. Charles Griffin and Co., Ltd. 4th Edition.
  22. Kleinrock, L. (1985). Queueing Systems. Vol. I and Vol. II. Wiley- New York, 1985.
  23. Metropolis, N. and Ulan, S. (1949). The Monte Carlo Method. Journal of American Statistical Association, Vol. 44, No 247, pp. 335-341.
  24. Murteira, B. (1979). Probabilidades e Estatística,. Vol. I. Editora McGraw-Hill de Portugal, Lda. Lisboa.
  25. Ramalhoto, M.F. (1983). A Note on the Variance of the Busy Period of the M/G/∞ Systems. Centro de Estatística e Aplicações, CEAUL, do INIC e IST.
  26. Stadje, W. (1985):.The Busy Period of the Queueing System M/G/∞. Journal of Applied Probability, Vol. 22, pp. 697-704.
  27. Syski, R. (1960). Introduction to Congestion Theory in Telephone Systems, Oliver and Boyd- London.
  28. Syski, R. (1986). Introduction to Congestion Theory in Telephone Systems. North Holland. Amsterdam.
  29. Tackács, L. (1962). An Introduction to Queueing Theory. Oxford University Press. New York.