Analysis of a three node queueing network
type: Item
instance of: scholarly article
title: Analysis of a three node queueing network
zbMATH Open document ID: 0654.60078
DOI: 10.1007/BF01159087
author: M. Yadin
author: Peter C. Kiessler
author: Benjamin Melamed
author: Robert D. Foley
published in: Queueing Systems
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4068013
zbMATH Keywords: Jackson queueing network
zbMATH Keywords: Kolmogorov-Smirnteady state vector which can be computed efficiently. Algorithms are also developed to compute the characteristics of the departure stream
MaRDI profile type: Publication
cites work: The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
cites work: The Dependence of Delays in Tandem Queues
cites work: The Output Process of a Stationary $M/M/s$ Queueing System
cites work: Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues
cites work: Q4109064
cites work: Passage times for overtake-free paths in Gordon–Newell networks
cites work: Q5512461
cites work: Sojourn times in closed queueing networks
cites work: The Kolmogorov-Smirnov Test for Goodness of Fit
cites work: On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
cites work: Sojourn Times in Queueing Networks
cites work: Q3683319
cites work: Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
cites work: Numerical Computation of Sojourn-Time Distributions in Queuing Networks
cites work: Waiting Times When Queues are in Tandem
cites work: Note on Queues in Tandem
cites work: Note—Some Results on Sojourn Times in Acyclic Jackson Networks
cites work: Sojourn times and the overtaking condition in Jacksonian networks
cites work: The amount of overtaking in a network of queues
cites work: Poisson Arrivals See Time Averages
description: scientific article; zbMATH DE number 4068013