Computing Customers Sojourn Times in Jackson Networks Distribution Functions and Moments

  title={Computing Customers Sojourn Times in Jackson Networks Distribution Functions and Moments},
  author={Manuel Alberto M. Ferreira},
  journal={Current Topics on Mathematics and Computer Science Vol. 1},
  • Manuel Alberto M. Ferreira
  • Published 26 May 2021
  • Mathematics, Computer Science
  • Current Topics on Mathematics and Computer Science Vol. 1
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, is an important measure of its performance, among others. In this work, the practical statistical known results about the sojourn time of a… 

Figures from this paper


This paper is about representations for equilibrium sojourn time distributions in Jackson networks of queues. For a network with N single-server nodes let h, be the Laplace transform of the residual
Analysis of a three node queueing network
The three node Jackson queueing network is the simplest acyclic network in which in equilibrium the sojourn times of a customer at each of the nodes are dependent. We show that assuming the
Network of waiting lines
The expressions for the mean queue length of the system for finite and infinite queueing spaces have been found out and some particular cases have been discussed.
LAPLACE transform effectiveness in the M/G/oo queue busy period probabilistic study
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
Jobshop-Like Queueing Systems
The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like "networks of waiting lines," where the mean arrival rate of customers depends almost arbitrarily upon the number already present, and the mean service rate at each service center depends almost arbitrary upon the queue length there.
Fundaments of Theory of Queues
Department of Quantitative Methods, ISCTE – IUL (PORTUGAL) E-mails:, Consider a Service Centre at which arrive units, the customers, requiring service
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
Networks of queues models with several classes of customers and exponential service times
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open
Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
A queueing application of the methodology to delay times in queueing networks is outlined and its efficacy is appraised by comparing the results with a sojourn time for a problem with a known distribution.
Positive correlations in a three-node Jackson queueing network
We show for the three-node Jackson network studied in [3] that a customer’s sojourn times in nodes 1 and 3 are positively correlated. We actually prove a stronger result, that the two sojourn times