Abstract
We consider networks of queues in discrete time, where the steady state distribution can be computed explicitly in closed form (product form networks): (i) Closed cycles and open tandems of single server FCFS Bernoulli nodes with state dependent service probabilities, where customers flow linearly, (ii) networks of doubly stochastic and geometrical queues (which are discrete time analogues of Kelly’s symmetric, resp. general, servers), where customers of different types move through the network governed by a general routing mechanism and request for service according to general, resp. geometrical, distributions, (iii) networks with batch movements of customers and batch service, where the service and routing mechanism is defined via an abstract transition scheme.
We describe recent developments of product form networks where nodes are unreliable, break down and are repaired. This opens the possibility to investigate performance and availability of networks in an integrated model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Daduna, H. (2011). Discrete Time Networks with Product Form Steady States. In: Boucherie, R., van Dijk, N. (eds) Queueing Networks. International Series in Operations Research & Management Science, vol 154. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6472-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6472-4_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6471-7
Online ISBN: 978-1-4419-6472-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)