Queueing Networks with Discrete Time Scale: Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks

✍ Scribed by Hans Daduna (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2001
• Tongue: English
• Leaves: 143
• Series: Lecture Notes in Computer Science 2046
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Introduction....Pages 1-7
State dependent Bernoulli Servers....Pages 9-22
Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types....Pages 23-52
Open Tandems of State Dependent Bernoulli Servers with Different Customer Types....Pages 53-72
Networks with Doubly Stochastic and Geometrical Servers....Pages 73-103
General Networks with Batch Movements and Batch Services....Pages 105-120
Appendix....Pages 121-123

✦ Subjects

Computer Communication Networks; System Performance and Evaluation; Operating Systems; Probability Theory and Stochastic Processes; Business Information Systems