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.
| ISBN: | 9783540423577 |
| Publication date: | 18th July 2001 |
| Author: | Hans Daduna |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 138 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Network hardware Stochastics Business mathematics and systems Probability and statistics Systems analysis and design Operating systems Business applications Computer hardware |
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.
Queueing Networks With Discrete Time Scale features in the following genres: Network hardware, Stochastics, Business mathematics and systems, Probability and statistics, Systems analysis and design, Operating systems, Business applications, Computer hardware
Queueing Networks With Discrete Time Scale is available in Paperback
Queueing Networks With Discrete Time Scale was written by Hans Daduna and published by Springer an imprint of Springer Berlin Heidelberg
Queueing Networks With Discrete Time Scale has 138 pages
Yes it is part of Lecture Notes in Computer Science series