Further remarks on queueing network theory
From MaRDI portal
(Redirected from Further remarks on queueing network theory)
Because the authors have tried to write a short review updating a number of aspects of the theory of queueing networks, they have had to deal with major topics in only a few paragraphs. The result is a review paper which, in some areas, devotes insufficient space and consequently leaves out a number of relevant papers and ideas. In future it may be preferable for short reviews to concentrate on the relations between queueing networks and just one of the topics quasi reversibility, sojourn times, insensitivity and traffic processes.
Recommendations
- scientific article; zbMATH DE number 3962926
- Queueing networks. A fundamental approach
- A note on Norton's theorem for queuing networks
- scientific article; zbMATH DE number 3962927
- A generalization of Norton's theorem for queueing networks
- Dobrushin's approach to queueing network theory
- Models and analysis of queueing networks
- scientific article; zbMATH DE number 941166
Cites work
- A Characterization of M/G/1 Queues with Renewal Departure Processes
- A Combinatorial Method in the Theory of Queues
- A criterion of insensitivity for a class of queueing systems with random marked point processes
- Analysis of a three node queueing network
- Characterizations of Poisson traffic streams in Jackson queueing networks
- Closed Queuing Systems with Exponential Servers
- Comparing counting processes and queues
- Comparing multi-server queues with finite waiting rooms, I: Same number of servers
- Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers
- Computational algorithms for closed queueing networks with exponential servers
- Generalized semi-Markov schemes and open queueing networks
- scientific article; zbMATH DE number 4174645 (Why is no real title available?)
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3155844 (Why is no real title available?)
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 3903723 (Why is no real title available?)
- scientific article; zbMATH DE number 3948142 (Why is no real title available?)
- scientific article; zbMATH DE number 4035753 (Why is no real title available?)
- scientific article; zbMATH DE number 4078444 (Why is no real title available?)
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3746207 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3796940 (Why is no real title available?)
- scientific article; zbMATH DE number 3217463 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- scientific article; zbMATH DE number 3050682 (Why is no real title available?)
- scientific article; zbMATH DE number 3072483 (Why is no real title available?)
- Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes
- Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds
- Insensitivity of steady-state distributions of generalized semi-Markov processes. I
- Networks of Waiting Lines
- 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
- On queueing systems with renewal departure processes
- On sojourn time in Jackson networks of queues
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Palm probabilities and stationary queues
- Poisson flows in single class open networks of quasireversible queues
- Queueing Networks: A Survey of Their Random Processes
- Sojourn Times in Queueing Networks
- Sojourn times in queuing networks with multiserver modes
- Stationary Distributions of Flows in Jackson Networks
- Stochastic Order Relationships Between GI/G/k Systems
- The Correlation Structure of the Output Process of Some Single Server Queueing Systems
- The insensitivity of stationary probabilities in networks of queues
- The output of a queuing system
- Two remarks on insensitive stochastic models
- Waiting Times When Queues are in Tandem
Cited in
(7)- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- Rejoinder on: ``Recent developments in the queueing problem
- scientific article; zbMATH DE number 3962927 (Why is no real title available?)
- A note on filtering in queueing networks and discrete event dynamic systems
- Dobrushin's ideas in the theory of queuing networks
- scientific article; zbMATH DE number 775065 (Why is no real title available?)
- scientific article; zbMATH DE number 6321253 (Why is no real title available?)
This page was built for publication: Further remarks on queueing network theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112470)
