Queueing Networks with Discrete Time Scale

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

  • Hans Daduna

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2046)

About this book


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

Authors and affiliations

  • Hans Daduna
    • 1
  1. 1.Fachbereich MathematikUniversität HamburgHamburgGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42357-7
  • Online ISBN 978-3-540-44592-0
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site