Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008779377/catalog> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b12306345.
- catalog created "c2001.".
- catalog date "2001".
- catalog date "c2001.".
- catalog dateCopyrighted "c2001.".
- catalog description "1. Introduction -- 2. State Dependent Bernoulli Servers -- 3. Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types -- 4. Open Tandems of State Dependent Bernoulli Servers with Different Customer Types -- 5. Networks with Doubly Stochastic and Geometrical Servers -- 6. General Networks with Batch Movements and Batch Services -- 7. Appendix.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. [125]-135) and index.".
- catalog extent "x, 138 p. ;".
- catalog identifier "3540423575 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2046".
- catalog issued "2001".
- catalog issued "c2001.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "519.8/2 21".
- catalog subject "Computer Communication Networks.".
- catalog subject "Computer science.".
- catalog subject "Computer system performance.".
- catalog subject "Distribution (Probability theory).".
- catalog subject "Management information systems.".
- catalog subject "Operating systems (Computers).".
- catalog subject "QA274.8 .D33 2001".
- catalog subject "Queuing theory.".
- catalog subject "Stochastic analysis.".
- catalog tableOfContents "1. Introduction -- 2. State Dependent Bernoulli Servers -- 3. Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types -- 4. Open Tandems of State Dependent Bernoulli Servers with Different Customer Types -- 5. Networks with Doubly Stochastic and Geometrical Servers -- 6. General Networks with Batch Movements and Batch Services -- 7. Appendix.".
- catalog title "Queueing networks with discrete time scale : explicit expressions for the steady state behavior of discrete time stochastic networks / Hans Daduna.".
- catalog type "text".