Queueing networks with dependent nodes and concurrent movements
type: Item
instance of: scholarly article
title: Queueing networks with dependent nodes and concurrent movements
zbMATH Open document ID: 0778.60065
DOI: 10.1007/BF01158932
author: Richard F. Serfozo
published in: Queueing Systems
publication date: 1993-08-17T00:00:00Z
review text: The aim of this paper is to describe the fundamental Markovian queueing network processes that have been developed to model networks with dependent nodes and concurrent movements of units. Detailed characterization of the departure rate function is given. Reversible networks are also treated. It is discussed how to compute performance parameters and normalizing constants for network processes.
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 218354
zbMATH Keywords: reversible networks
zbMATH Keywords: queueing network
zbMATH Keywords: characterization of the departure rate function
reviewed by: János Sztrik
MaRDI profile type: Publication
cites work: Insensitive average residence times in generalized semi-Markov processes
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: Limit Theorems for Queueing Networks. I
cites work: Q4001402
cites work: On queueing network models of flexible manufacturing systems
cites work: Stochastic discrete flow networks: Diffusion approximations and bottlenecks
cites work: Q3199178
cites work: Queueing Networks: A Survey of Their Random Processes
cites work: Q4742085
cites work: Q3800856
cites work: Q3944001
cites work: Product-form queueing networks with negative and positive customers
cites work: Cyclic Queuing Systems with Restricted Length Queues
cites work: Brownian models of open queueing networks with homogeneous customer populations∗
cites work: Product form in networks of queues with batch arrivals and batch services
cites work: Closed queueing networks with batch services
cites work: Q3734820
cites work: Q3709574
cites work: Markov chain models - rarity and exponentiality
cites work: Sojourn times in closed queueing networks
cites work: Markov population processes
cites work: Travel and sojourn times in stochastic networks
cites work: A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
cites work: Asymptotic expansions for closed Markovian networks with state-dependent service rates
cites work: A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
cites work: Preserving partial balance in continuous-time Markov chains
cites work: Connecting reversible Markov processes
cites work: Open Queueing Networks in Heavy Traffic
cites work: Waiting Times When Queues are in Tandem
cites work: Mean-Value Analysis of Closed Multichain Queuing Networks
cites work: Poisson functionals of Markov processes and queueing networks
cites work: Markovian network processes: Congestion-dependent routing and processing
cites work: Q3138416
cites work: Queuing Network Models with State-Dependent Routing
cites work: Q4714399
cites work: Sojourn times and the overtaking condition in Jacksonian networks
cites work: Flows in Queueing Networks: A Martingale Approach
cites work: Q5623026
cites work: Equilibrium distributions for an open migration process
cites work: Q3816817
description: scientific article; zbMATH DE number 218354