Further remarks on queueing network theory

DOI10.1016/0377-2217(88)90121-XzbMath0659.60123OpenAlexW2088582125MaRDI QIDQ1112470

Ralph L. Disney, Peter C. Kiessler

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90121-x

zbMATH Keywords

queueing networksreversibilityinsensitivity

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palm probabilities and stationary queues
• Analysis of a three node queueing network
• Poisson flows in single class open networks of quasireversible queues
• Insensitivity of steady-state distributions of generalized semi-Markov processes. I
• A criterion of insensitivity for a class of queueing systems with random marked point processes
• Waiting Times When Queues are in Tandem
• On queueing systems with renewal departure processes
• Queueing Networks: A Survey of Their Random Processes
• Two remarks on insensitive stochastic models
• On sojourn time in Jackson networks of queues
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• Sojourn times in queuing networks with multiserver modes
• Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes
• Comparing counting processes and queues
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Generalized semi-Markov schemes and open queueing networks
• On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
• Sojourn Times in Queueing Networks
• Stationary Distributions of Flows in Jackson Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds
• The insensitivity of stationary probabilities in networks of 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
• Characterizations of Poisson traffic streams in Jackson queueing networks
• A Characterization of M/G/1 Queues with Renewal Departure Processes
• The Output of a Queuing System
• Networks of Waiting Lines
• The Correlation Structure of the Output Process of Some Single Server Queueing Systems
• Closed Queuing Systems with Exponential Servers
• Stochastic Order Relationships Between GI/G/k Systems
• Computational algorithms for closed queueing networks with exponential servers
• A Combinatorial Method in the Theory of Queues

This page was built for publication: Further remarks on queueing network theory