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

by Hans Daduna

Overview

Building on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or shastic 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 shastic networks.

Product Details

ISBN-13:	9783540423577
Publisher:	Springer Berlin Heidelberg
Publication date:	08/24/2001
Series:	Lecture Notes in Computer Science , #2046
Edition description:	2001
Pages:	142
Product dimensions:	6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

State dependent Bernoulli Servers.- Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types.- Open Tandems of State Dependent Bernoulli Servers with Different Customer Types.- Networks with Doubly Shastic and Geometrical Servers.- General Networks with Batch Movements and Batch Services.