Notes about Queueing Networks

2.4 Queuing Networks
Queuing network analysis is a well-known technique
to estimate the performance of systems. As
long as the process to investigate is in some way
to model in queues, this powerful analysis method
can help to design, gain experience about and
optimize it. The main idea of this theory is to
describe the system with interconnected queues
and servers. Of course, for large systems the representing
queuing model becomes rather large as
well.
To cope with these problems, tools for the automated
queuing network analysis can be used. One
example is the function library PDQ (pretty damn
quick)(Gunther, 2000). It provides the ability to
compute relatively large queuing networks in a
short time. Though, generating and specifying a
model is rather circumstantial. It has to be done in
C-les. As a result of the computation, PDQ oers
manifold information about the analyzed system
(e.g. utilization of the servers, residence times and
delays). But only with the knowledge of the environmental
behavior and the corresponding impact
on the queuing model, common-sense results can
be achieved.

http://web.inf.tu-dresden.de/~mn7/publications/neugebauer03prediction.pdf