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 individual sojourn times are independent provides a good approximation to the total sojourn time. This is done by simulating the network and showing that the sojourn times generally pass a Kolmogorov-Smirnteady state vector which can be computed efficiently. Algorithms are also developed to compute the characteristics of the departure stream of customers from each queue. Some numerical results are presented, and based on these results an efficient approximation scheme for the system is developed which may possibly be extended to systems with more than two parallel queues.
- scientific article; zbMATH DE number 3905611 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues
- Note on Queues in Tandem
- Note—Some Results on Sojourn Times in Acyclic Jackson Networks
- Numerical Computation of Sojourn-Time Distributions in Queuing Networks
- On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
- Passage times for overtake-free paths in Gordon–Newell networks
- Poisson Arrivals See Time Averages
- Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
- Sojourn times and the overtaking condition in Jacksonian networks
- Sojourn times in closed queueing networks
- Sojourn Times in Queueing Networks
- The amount of overtaking in a network of queues
- The Dependence of Delays in Tandem Queues
- The Kolmogorov-Smirnov Test for Goodness of Fit
- The Output Process of a Stationary M/M/s Queueing System
- The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
- Waiting Times When Queues are in Tandem
- Further remarks on queueing network theory
- Maxima of sojourn times in acyclic Jackson queueing networks
- Measurement and optimization of responsiveness in supply chain networks with queueing structures
- An approximation model for sojourn time distributions in acyclic multi-server queueing networks
- An Enhanced Approximation by Pair-Wise Analysis of Servers for Time Delay Distributions in Queueing Networks
- On sojourn time in Jackson networks of queues
- Numerical Computation of Sojourn-Time Distributions in Queuing Networks
- Positive correlations in a three-node Jackson queueing network
- Simultaneous busy periods for nodes in a stochastic network
- scientific article; zbMATH DE number 1215039 (Why is no real title available?)
- Algorithm of balance equations decomposition and investigation of Poisson flows in Jackson networks
- Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
- A tandem Jackson network with feedback to the first node
This page was built for publication: Analysis of a three node queueing network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108676)
