Performance modelling of communication networks and computer architectures / Peter G. Harrison, Naresh M. Patel.
By: Harrison, Peter G
.
Contributor(s): Patel, Naresh M.
Material type: 
BookSeries: International computer science series.Publisher: Wokingham, England ; Reading, Mass. : Addison-Wesley, c1993Description: xiii, 472 p. : ill. ; 24 cm.ISBN: 0201544199.Subject(s): Computer networks -- Evaluation | Computer architecture -- EvaluationDDC classification: 004.6 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 004.6 (Browse shelf(Opens below)) | 1 | Available | 00009535 |
Enhanced descriptions from Syndetics:
A text that discusses queueing network models and algorithms for computing performance measures. Presents recent results in the analysis of blocking problems, maximum entropy methods, time delay distributions, and switching networks. Annotation c. by Book News, Inc., Portland, Or.
Includes bibliographical references (pages 460-464) and index.
Essentials of Probability Theory -- Random Variables and Distributions -- Expected Values and Moments -- Stochastic Processes -- Queues -- Single class queueing networks -- Multi-class Queueing Networks -- Approximate Methods -- Time Delays -- Blocking in Queueing Networks -- Switching Network Models.
Table of contents provided by Syndetics
- 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
Author notes provided by Syndetics
About Peter Harrison Peter Harrison is Reader in Computer Science at Imperial Collegein London and co-author of a highly -acclaimed book on FunctionalProgramming. About Naresh Patel Naresh Patel was formerly a Research Assistant inComputer Science at Imperial Collegein London and is now a Performace Modelling Engineerwith the System Performance Modelling Group at Tandem ComputersInc. in Cupertino, California.
0201544199AB04062001