PERFORMANCE '96
Lausanne, October 7-11, 1996
International Conference on Performance Theory, Measurement
and Evaluation of Computer and Communication Systems
(Organised by IFIP WG7.3)
Discrete Time Queueing Networks: Recent Developments
Tuesday 8 October
11:00 - 12:30
Hans Daduna, Universitaet Hamburg, Institut fur Mathematische Statistik
Abstract
The emerging new techniques for broadband communication systems revived
discrete time queueing theory, especially queueing networks as a tool
for modeling and evaluating such systems. The tutorial will be 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:
- Linear networks (closed cycles and open tandems) of single server
FCFS Bernoulli nodes.
- Networks of doubly-stochastic queues (which are discrete time
analoga of Kelly's symmetric servers): Customers of different
types move through the network governed by a general routing
mechanism and request for service according to general
distributions.
- 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 shall discuss computational
algorithms for the standard performance measures and present
results on the end-to-end-delay distributions and their moments.
Open problems and directions for further research will be sketched.
Download the postscript versions of this tutorial :
Back to Tutorials list