Queueing Networks with Discrete Time Scale

Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks

Hans Daduna

138 pages, parution le 01/09/2001

Ajouter à une liste

Indisponible

Résumé

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.

Contents

Introduction
State dependent Bernoulli servers
Closed cycles of state dependent Bernoulli servers with different customer types
Open tandems of stae dependent Bernoulli servers with different customer types
Networks with doubly stochstic and geometrical servers
General networks with batch movement and batch servers
Appendix
Bibliography
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Hans Daduna
Parution	01/09/2001
Nb. de pages	138
Format	15,5 x 23,5
Couverture	Broché
Poids	204g
Intérieur	Noir et Blanc
EAN13	9783540423577