Computer Networks and Systems: Queueing Theory and Performance Evaluation
Statistical performance evaluation has assumed an increasing amount of importance as we seek to design more and more sophisticated communi cation and information processing systems. The ability to predict a pro posed system's performance without actually having to construct it is an extremely...
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
New York, NY
Springer New York
1990, 1990
|
Edition: | 1st ed. 1990 |
Series: | Telecommunication Networks and Computer Systems
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 : The Queueing Paradigm
- 1.1 Introduction
- 1.2 Queueing Theory
- 1.3 Queueing Models
- 1.4 Case Study I: File Service
- 1.5 Case Study II: Multiprocessor
- 2: Single Queueing Systems
- 2.1 Introduction
- 2.2 The M/M/l Queueing System
- 2.3 Little’s Law
- 2.4 Reversibility and Burke’s Theorem
- 2.5 The State Dependent M/M/1 Queueing System
- 2.6 The M/M/l/N Queueing System
- 2.7 The M/M/? Oueueing System
- 2.8 The M/M/m Oueueing System
- 2.9 The M/M/m/m Oueue: A Loss System
- 2.10 The Central Server CPU Model
- 2.11 Transient Solution of the M/M/l/. Queueing System
- 2.12 The M/G/l Oueueins System
- To Look Further
- Problems
- 3: Networks of Queues
- 3.1 Introduction
- 3.2 The Product Form Solution
- 3.3 Algebraic Topological Interpretation of P.F. Solution
- 3.4 Recursive Solution of Non-Product Form Networks
- 3.5 Case Study I: Queueing on a Space Division Packet Switch
- 3.6 Case Study II: Queueing on a Single-Buffered Banyan Network
- 3.7 Case Study III: DQDB Erasure Station Location
- To Look Further
- Problems
- 4: Numerical Solution of Models
- 4.1 Introduction
- 4.2 Closed Networks: Convolution Algorithm
- Example 1: State Independent Servers
- Example 2: State Independent Servers
- Example 3: State Dependent Servers
- 4.3 Mean Value Analysis
- Examples of the Use of the MVA Algorithm
- Example 1: M Cyclic Queues
- Example 2: Cyclic Queueing Network Numerical Example
- 4.4 PANACEA: Approach for Large Markovian Queueing Networks
- 4.5 Discrete Time Queueing Systems
- 4.6 Simulation of Communication Networks
- To Look Further
- Problems
- 5: Stochastic Petri Nets
- 5.1 Introduction
- 5.2 A Bus Oriented Multiprocessor Model
- 5.3 Toroidal MPN Lattices
- 5.4 The Dining Philosophers Problem
- 5.5 A Station Oriented CSMA Protocol Model
- 5.6 The AlternatingBit Protocol
- 5.7 Conclusion
- To Look Further
- Appendix: Probability Theory Review
- References