Computing Customers Sojourn Times in Jackson Networks Distribution Functions and Moments

Authors

  • Manuel Alberto M. Ferreira ISTAR-IUL - Information Sciences, Technologies and Architecture Research Center (ISTA), Instituto Universitário de Lisboa, Lisboa, Portugal.

DOI:

https://doi.org/10.9734/bpi/ctmcs/v1/9530D

Keywords:

Jackson networks, sojourn time, network flow equations, randomization procedure

Abstract

Jackson queuing networks have a lot of practical applications, mainly in services and technologic devices. For the first case, an example are the healthcare networks and, for the second, the computation and telecommunications networks. Evidently the time that a customer - a person, a job, a message … – spends in this kind of systems, its sojourn time[1], is an important measure of its performance, among others. 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.  

Published

2021-05-26

How to Cite

Manuel Alberto M. Ferreira. (2021). Computing Customers Sojourn Times in Jackson Networks Distribution Functions and Moments. Current Topics on Mathematics and Computer Science Vol. 1, 123–135. https://doi.org/10.9734/bpi/ctmcs/v1/9530D