Analysis of a three node queueing network

DOI10.1007/BF01159087zbMath0654.60078MaRDI QIDQ1108676

M. Yadin, Peter C. Kiessler, Robert D. Foley, Benjamin Melamed

Publication date: 1988

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

Jackson queueing networkKolmogorov-Smirnteady state vector which can be computed efficiently. Algorithms are also developed to compute the characteristics of the departure stream

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

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 ⋮ Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking

Cites Work

• Waiting Times When Queues are in Tandem
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• The amount of overtaking in a network of queues
• Sojourn times in closed queueing networks
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• Sojourn times and the overtaking condition in Jacksonian networks
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Passage times for overtake-free paths in Gordon–Newell networks
• Poisson Arrivals See Time Averages
• On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
• Sojourn Times in Queueing Networks
• The Dependence of Delays in Tandem Queues
• Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues
• The Output Process of a Stationary $M/M/s$ Queueing System
• Note on Queues in Tandem
• The Kolmogorov-Smirnov Test for Goodness of Fit
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of a three node queueing network