Algorithm to Compute the Global Service Time Distribution in an Open Network of Mginf Queues Through Laplace Transforms

EasyChair Preprint 9231

Abstract

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 MGInf 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 MGInf 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.

Keyphrases: Laplace transform, MGInf, algorithm, busy period, queues network

@booklet{EasyChair:9231,
  author    = {Manuel Alberto M. Ferreira},
  title     = {Algorithm to Compute the Global Service Time Distribution in an Open Network of Mginf Queues Through Laplace Transforms},
  howpublished = {EasyChair Preprint 9231},
  year      = {EasyChair, 2022}}