Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks (Q5940716): Difference between revisions

This well-written text reports on the analysis of discrete-time stochastic network models, focusing in particular on the question whether there is a discrete-time analogue for the product-form calculus of continuous-time stochastic network models. From the preface: The text is centered around explicit expressions for the steady-state behaviour of discrete-time queueing networks. Three classes of networks which show a product-form equilibrium will be discussed in detail: (1) Linear networks (closed cycles and open tandems) of single-server FCFS Bernoulli nodes. (2) Networks of doubly stochastic and geometrical queues (which are discrete-time analogues of Kelly's symmetric and general servers and of the BCMP nodes). Customers of different types move through the network governed by a general routing mechanism. Requests for servers at symmetry servers may be according to general distributions. (3) Networks with batch movements of customers and batch service. The service and routing mechanism is defined on the basis of an abstract transition scheme. -- We further discuss computational algorithms for the standard performance measures and present explicit results on end-to-end delay distributions and their moments.