Queueing Networks with Discrete Time Scale

1. Front Matter

   Pages I-X

   PDF

2. Introduction

   Pages 1-7

3. State dependent Bernoulli Servers

   Pages 9-22

4. Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types

   Pages 23-52

5. Open Tandems of State Dependent Bernoulli Servers with Different Customer Types

   Pages 53-72

6. Networks with Doubly Stochastic and Geometrical Servers

   Pages 73-103

7. General Networks with Batch Movements and Batch Services

   Pages 105-120

8. Appendix

   Pages 121-123

9. Back Matter

   Pages 125-138

   PDF

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.

• ATM Networks
• Bernoulli Servers
• Communication Networks
• Demand and Supply
• Discrete Time Stochastic Networks
• Linear Networks
• Markov Chains
• Networking
• Performance Analysis
• Queueing Networks
• Stochastic Networks
• communication
• computer
• queueing theory
• stochastic network

• Fachbereich Mathematik, Universität Hamburg, Hamburg, Germany

  Hans Daduna

Policies and ethics