Skip to main content

Queueing Networks with Discrete Time Scale

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

  • Textbook
  • © 2001

Overview

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

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.

Authors and Affiliations

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

    Hans Daduna

Bibliographic Information

Publish with us