Queueing Systems Volume 1: Theory Leonard Kleinrock This book presents and develops methods from queueing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field. It provides a long-n
Decomposability. Queueing and Computer System Applications
β Scribed by P. J. Courtois and Robert L. Ashenhurst (Auth.)
- Publisher
- Elsevier Inc, Academic Press Inc
- Year
- 1977
- Tongue
- English
- Leaves
- 209
- Series
- ACM monograph series
- Edition
- First Edition
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content:
ACM MONOGRAPH SERIES, Page ii
Front Matter, Page iii
Copyright, Page iv
Foreword, Pages ix-x
Preface, Pages xi-xii
Acknowledgments, Page xiii
Introduction and Overview, Pages 1-10
CHAPTER I - Nearly Completely Decomposable Systems, Pages 11-27
CHAPTER II - On the Degree of Approximation, Pages 28-48
CHAPTER III - Criterion for Near-Complete Decomposability Equivalence Classes of Aggregates, Pages 49-56
CHAPTER IV - Decomposability of Queueing Networks, Pages 57-68
CHAPTER V - Hierarchy of Aggregate Resources, Pages 69-75
CHAPTER VI - Queueing-Network Analysis, Pages 76-87
CHAPTER VII - Memory Hierarchies, Pages 88-104
CHAPTER VIII - Near-Complete Decomposability in Program Behavior, Pages 105-129
CHAPTER IX - Instabilities and Saturation in Multiprogramming Systems, Pages 130-171
CHAPTER X - Hierarchical System Design, Pages 172-178
Conclusions, Pages 179-181
APPENDIX I - Proof of Theorem 2.I, Page 182
APPENDIX II - Proof of Theorem 2.2, Pages 183-184
APPENDIX III - Numerical Example, Pages 185-188
APPENDIX IV - Eigenvalues of the MatrixQ(N, 1), Pages 189-190
References, Pages 191-196
Index, Pages 197-201
π SIMILAR VOLUMES
This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication
This self-contained text, intended for a first course in performance evaluation, covers all aspects of queueing theory. It starts by introducing readers to the terminol- ogy and usefulness of queueing theory. Chapter two then covers Markovian queues in equilibrium, Little's Law, reversibility, trans
This text, intended for a first course in performance evaluation, is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queuing theory and continues by considering Markovian queues in equilibrium, Little's law, rev
<p>Statistical performance evaluation has assumed an increasing amount of importance as we seek to design more and more sophisticated communication and information processing systems. The ability to predict a proposed system's perΒ formance before one constructs it is an extremely cost effective des