具离散时标的排队网络/Queueing networks with discrete time scale
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Hans Daduna 著
出 版 社： 湖南文艺出版社
出版时间： 2001-12-1字数：版次： 1页数： 138印刷时间： 2001/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540423577包装： 平装内容简介
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.
目录
1 Introduction
1.1 Introduction
1.2 Symbols and Conventions
2 State Dependent Bernoulli Servers
2.1 Indistinguishable Customers
2.2 Customers of Different Types
2.3 Bernoulli Servers with Immediate Feedback
3 Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types
3.1 Steady State Behaviour and Arrival Theorem
3.2 Closed Cycles of Bernoulli Servers - The Multichain Case
3.3 Delay Time Distribution for Customers in a Closed Cycle of State Independent Bernoulli Servers
3.4 Computational Algorithms for Closed Cycles of State Independent Bernoulli Servers
4 Open Tandems of State Dependent Bernoulli Servers with Different Customer Types
4.1 The Principle of Adjusted Transfer Rates
4.2 Steady State and Arrival Theorem
4.3 Delay Time Distribution for Customers in an Open Tandem of State Independent Bernoulli Servers
4.4 Re entrant Lines
5 Networks with Doubly Stochastic and Geometrical Servers
5.1 Description of the Doubly Stochastic Server
5.2 Description of the Geometrical Server
5.3 Open Networks of Doubly Stochastic and Geometrical Nodes
5.4 Stationary State for the Open Network with Doubly Stochastic and Geometrical Nodes
5.5 Performance Measures for Open Networks
5.6 Closed Networks of Doubly Stochastic and Geometrical Nodes
5.7 Open Tandems of Doubly Stochastic Nodes with State Independent Arrival Streams, and Reversibility
6 General Networks with Batch Movements and Batch Services
6.1 The General Network Model
6.2 Steady States
6.3 Related Examples and Discussion of the Model
6.4 Walrand's S-Queues and Networks
6.5 Networks with Triggered Batch Movements
7 Appendix
7.1 Time Reversed Processes
7.2 Symmetric Functions
Bibliography
Index
