Performance modelling of communication networks and computer architectures
著者
書誌事項
Performance modelling of communication networks and computer architectures
（International computer science series）
Addison-Wesley, c1993
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 460-464) and index
内容説明・目次
内容説明
With the advent of communication networks of staggering complexity, and new generations of parallel computers, sophisticated models and techniques have been developed to evaluate their performance. This book presents the latest techniques for performance modelling to guide designers in their quest for efficiency. Highlights of the book include: * An in-depth study queueing network models and algorithms for computing performance measures. * Unique presentation of recent results in the analysis of blocking problems, maximum entropy methods, time delay distributions and switching networks. * A self-contained presentation of relevant stochastic process theory. * A wealth of exercises and sample solutions With its balance between theoretical issues and practical applications, the book will be invaluable for network engineers and system designers, as well as for students in computer science and engineering taking courses in performance modelling or queueing network analysis. 0201544199B04062001
目次
(Each chapter concludes with Exercises.) Preface. 1. Essentials of Probability Theory. Sample space, events and probability. Conditional probability. Independence. 2. Random Variables and Distributions. Probability distribution functions. Discrete random variable. Continuous random variables. Joint random variables. Conditional distributions. Independence and sums. 3. Expected Values and Moments. Expectation. Generating functions and transforms. Asymptotic properties. 4. Stochastic Processes. Random walks. Markov chains. Markov processes. Reversibility. Renewal theory. 5. Queues. Simple Markovian queues. The M/G/1 queue. The G/G/1 queue. 6. Single Class Queueing Networks. Introduction. Open queueing networks. Closed queueing networks. Mean value analysis. Performance measures for the state-dependent case. The flow equivalent server method. 7. Multi-class Queueing Networks. Service time distributions. Types of service centre. Multi-class traffic model. BCMP theorem. Properties and extensions of BCMP networks. Computational algorithms for BCMP networks. Priority disciplines. Quasi-reversibility. 8. Approximate Methods. Decomposition. Fixed point methods. Diffusion approximation. Maximum entropy methods. 9. Time Delays. Time delays in the single server queue. Time delays in networks of queues. Inversion of the Laplace transforms. Approximate methods. 10. Blocking in Queueing Networks. Introduction. Types of blocking. Two finite queues in a closed network. Aggregating Markovian states. BAS blocking. BBS blocking. Repetitive service blocking. 11. Switching Network Models. Telephone networks. Interconnection networks for parallel processing systems. Models of the full crossbar switch. Multi-stage interconnection networks. Models of synchronous MINS. Models of asynchronous MINS. Interconnection networks in a queueing model. Appendix: Outline Solutions. References. Index. 0201544199T04062001
「Nielsen BookData」 より