M/G/\(\infty\) tandem queues
type: Item
instance of: scholarly article
title: M/G/\(\infty\) tandem queues
zbMATH Open document ID: 0547.60090
DOI: 10.1016/0304-4149(84)90168-6
published in: Stochastic Processes and their Applications
publication date: 1984-01-01T00:00:00Z
review text: Another contribution to the currently fashionable topic of networks of service systems. The subsystems are in this case in series and each node is endowed with an infinite number of parallel service channels. The input to the total system is Poisson and the service times at each node have a common distribution which may be different from node to node. A neat analysis yields the joint stationary distribution of the numbers of customers at the various nodes when a particular customer arrives there on his way through the system. It is interesting to speculate how far the analysis might go with finite (greater than one) numbers of channels at the nodes.
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 3872445
zbMATH Keywords: tandem queue
zbMATH Keywords: networks of service systems
author: Onno Boxma
reviewed by: Brian Conolly
MaRDI profile type: Publication
full work available at URL: 0304-4149(84)90168-6
OpenAlex ID: W1519002859
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: The multiple phase service network with generalized processor sharing
cites work: On a coincidence problem concerning telephone traffic
cites work: A Combinatorial Method in the Theory of Queues
cites work: Poisson Arrivals See Time Averages
cites work: A note on networks of infinite-server queues
cites work: Markov population processes
description: scientific article; zbMATH DE number 3872445