Volume 4, Number 4 / August issue 2018
Manuel Alberto M. Ferreira
The laplace transform in the context of some of the M|G|∞ queue related probability distributions

The Laplace transform is a widely used tool in the study of probability distributions, often allowing for a simpler determination of the p.d.f.'s and d.f.'s, and having the possibility to work as a “moments generating function”. In this paper it is considered a situation not so simple, as it is the case of the M|G|∞ queue busy period length distribution. Attention will also be given the respective tail Laplace transform. Then, in the context of an open queues network, which nodes behave as M|G|∞ queues, the Laplace transform will be used to construct an algorithm to determine the Laplace transform of the global service time length of a customer during their stay on the network distribution.
Keywords: Laplace transform, M|G|∞, busy period, queues network, algorithm

Cite this article:
Manuel Alberto M. Ferreira. The laplace transform in the context of some of the M|G|∞ queue related probability distributions. Acta Scientiae et Intellectus, 4(4)2018, 24-31.


  1. J.A. Filipe, M.A.M. Ferreira. Infinite Servers Queue Systems Busy Period-A Practical Case in Logistics Problems Solving. Applied Mathematical Sciences, 9(2015), 25-28, 1221-1228.
  2. J. Walrand. An Introduction to Queueing Networks. New Jersey: Prentice-Hall, Inc. 1988.
  3. L. Tackács. An Introduction to Queueing Theory. Oxford University Press. New York, 1962.
  4. M.A.M. Ferreira. Momentos da Duração do Período de Ocupação de Sistemas de Filas de Espera com Infinitos servidores. Actas da 5ª Conferência CEMAPRE, 429-438. ISEG, Lisboa 26, 27,28 de Maio, 1997.
  5. M.A.M. Ferreira. The Exponentiality of the M|G∞ queue busy period. XII Jornadas Luso-Espanholas de Gestão Científica-ACTAS (Volume VIII-Economia da Empresa e Matemática Aplicada), 267-272. Universidade da Beira Interior, Departamento de Gestão e Economia, Covilhã, Abril 2002.
  6. M.A.M. Ferreira, J.A. Filipe. Occupation Study of a Surgery Service through a Queues Model. Applied Mathematical Sciences, 9(2015), 93-96, 4791-4798.
  7. M.A.M. Ferreira, M. Andrade. The Ties between the M|G∞ Queue System Transient Behavior and the Busy Period. International Journal of Academic Research, 1 (2009), 1, 84-92.
  8. M.A.M. Ferreira, M. Andrade. Looking to a M|G∞ system occupation through a Riccati equation. Journal of Mathematics and Technology, 1(2010), 2, 58-62.
  9. M.A.M. Ferreira, M. Andrade. M|G∞ System Transient Behavior with Time Origin at the Beginning of a Busy Period Mean and Variance. APLIMAT-Journal of Applied Mathematics, 3(2010), 3, 213-221.
  10. M.A.M. Ferreira, M. Andrade. M|G∞ Queue Busy Period Tail. Journal of Mathematics and Technology, 1(2010), 3, 11-16.
  11. M.A.M. Ferreira, M. Andrade. Algorithm for the Calculation of the Laplace-Stieltjes Transform of the Sojourn Time of a Costumer in an Open Network of Queues, with a Product Form Equilibrium Distribution, assuming Independent Sojourn Times in each Node. Journal of Mathematics and Technology, 1(2010), 4, 31-36.
  12. M.A.M. Ferreira, M. Andrade. Infinite Servers Queue Systems Busy Period Length Moments. Journal of Mathematics and Technology, 3(2012), 2, 4-7.
  13. M.A.M. Ferreira, M. Andrade, J.A Filipe. The Riccati Equation in the M|G∞ System Busy Cycle Study. Journal of Mathematics, Statistics and Allied Fields, 2 (2008), 1.
  14. M.J. Carrillo. Extensions of Palm’s Theorem: A Review. Management Science, 37(1991), 6, 739-744.
  15. R.L. Disney and D. König. Queueing networks: a survey of their random processes. Siam Review, 3(1985), 335-403.
  16. S. Skiena, “Polya's Theory of Counting." §1.2.6 in Implementing Discrete Matyhematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 25-26, 1990.
  17. W. Stadje. The Busy Period of the Queueing System M|G∞. Journal of Applied Probability, 22(1985), 697-704.