• Corpus ID: 202126526

LAPLACE transform effectiveness in the M/G/oo queue busy period probabilistic study

  title={LAPLACE transform effectiveness in the M/G/oo queue busy period probabilistic study},
  author={Manuel Alberto M. Ferreira},
The Laplace transform is a widely used tool in the study of probability distributions, often allowing for a probability density functions and distribution functions simpler determination and being 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… 
1 Citations
Computing Customers Sojourn Times in Jackson Networks Distribution Functions and Moments
  • Manuel Alberto M. Ferreira
  • Mathematics, Computer Science
    Current Topics on Mathematics and Computer Science Vol. 1
  • 2021
In this work, the practical statistical known results about the sojourn time of a customer, in a Jackson network, distribution are collected and presented and an emphasis is set on the numerical methods applicable to compute the distribution function and the moments.


In the Search for the Infinite Servers Queue with Poisson Arrivals Busy Period Distribution Exponential Behavior
This paper purpose is to investigate exponential behavior conditions for the M|G|∞ queue busy period length distribution. It is presented a general theoretical result that is the basis of this work.
Study of a collection of service time distributions and impact in the respective M|G|8 system busy period parameters
The problems arising when computing the moments of a particular service time distributions collection, for which the M|G|∞ queue system busy period becomes very easy to study, are presented and it is
ABSTRACT This paper main subject is the M  G ∞ queue system transient probabilities study as time functions. It is completely achieved when the time origin is an unoccupied system instant. But such
First order differential equations induced by the infinite servers queue with poisson arrivals transient behavior probability distribution parameters study as time functions
The M|G| queue system state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which
Extensions of Palm's theorem: a review
This note reviews the transient behavior the M/G/\infty queue with nonhomogeneous Poisson or compound Poisson input and nonstationary service distribution. In the case of nonhomogeneous Poisson
Queueing Networks: A Survey of Their Random Processes
In this paper we review three topics in queueing network theory: queue length processes, sojourn times, and flow processes. In the discussion of the queue length processes we present results for the
The busy period of the queueing system M / G /∞
For the queueing system M/G/oo some distributions connected with the associated busy periods are derived. QUEUES WITH UNLIMITED SERVICE
Introduction to queueing networks
A comparison of G-Networks with Multiple Classes of Signals and Positive Customers and Discrete-Time Queueing Systems shows how different approaches to queue management can produce different results.
Infinite servers queue systems busy period - a practical case on logistics problems solving
With this model it is possible to obtain system performance measures and also to contribute to solve organizing structures’ problems, by minimizing the risks of the organizations inoperative structures, with considerable logistics pernicious consequences for companies.
Financially dependent pensions funds maintenance approach through Brownian motion processes
The situation of some pensions funds that are not appropriately auto financed and are thoroughly maintained with an outside financing effort is considered in this paper. To represent the unrestricted