Queueing Networks with Discrete Time Scale

Hans Daduna

ISBN 10: 3540423575 / ISBN 13: 9783540423577

Published by Springer, Springer Jul 2001, 2001

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 152 pp. Englisch.

Seller Inventory # 9783540423577

Bibliographic Details

• Title: Queueing Networks with Discrete Time Scale
• Publisher: Springer, Springer Jul 2001
• Publication Date: 2001
• Language: English
• ISBN 10: 3540423575
• ISBN 13: 9783540423577
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 9D millimeters 235 millimeters width by 155 millimeters height by 9 millimeters depth
• Weight: 242 grams

About this title

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.