Queueing Networks with Discrete Time Scale [electronic resource] : Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks / by Hans Daduna.
Daduna, Hans. author.
SpringerLink (Online service)
Computer science.
Information technology.
Business Data processing.
Computer communication systems.
Computer system failures.
Operating systems (Computers).
Computer engineering.
Probabilities.
TK5105.5-5105.9
004.6 23
Building on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or stochastic networks has been a field of intensive research over the last three decades. Whereas the first breakthrough in queueing network theory was initiated by problems and work in operations research, the second breakthrough, as well as subsequent major work in the area, was closely related to computer science, particularly to performance analysis of complex systems in computer and communication science. The text reports on recent research and development in the area. It is centered around explicit expressions for the steady behavior of discrete time queueing networks and gives a moderately positive answer to the question of whether there can be a product form calculus in discrete time. Originating from a course given by the author at Hamburg University, this book is ideally suited as a text for courses on discrete time stochastic networks.
2001
Text
X, 142 p.
http://dx.doi.org/10.1007/3-540-44592-7
eng
Springer eBooks
Lecture Notes in Computer Science, 0302-9743 ; 2046
Lecture Notes in Computer Science, 0302-9743 ; 2046