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

Hans Daduna

ISBN 10: 3540423575 / ISBN 13: 9783540423577

Edité par Springer Berlin Heidelberg, 2001

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de réf. du vendeur 9783540423577

Détails bibliographiques

• Titre: Queueing Networks with Discrete Time Scale : Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks
• Éditeur: Springer Berlin Heidelberg
• Date de parution: 2001
• Langue: anglais
• ISBN à 10 chiffres: 3540423575
• ISBN à 13 chiffres: 9783540423577
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

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.