TYPE B

Thomas G. Robertazzi

Computer Networks and Systems:

Queueing Theory and
Performance Evaluation
With 92 Illustrations

Technische Hochschule Darmstadt

FACHBEREICH INFORMATIK

B I B L I O T H E K
Inventar-Mc:
Sachgebiete:
Standort:

Springer- Verlag
New York Berlin Heidelberg London
Paris Tokyo Hong Kong Barcelona

Table of Contents

Preface

vii

Chapter 1: The Queueing Paradigm

1.1 Introduction
1.2 Queueing Theory
1.3 Queueing Models
1.4 Case Study I: File Service
By W.G. Nichols and J.S. Emer
1.5 Case Study II: Multiprocessor
By B.L. Bodnar and A.C. Liu
Chapter 2: Single Queueing Systems
2.1 Introduction
2.2 The M/M/l Queueing System
2.2.1 The Poisson Process
2.2.2 Foundation of the Poisson Process
2.2.3 Poisson Distribution Mean and Variance
2.2.4 The Inter-Arrival Times
2.2.5 The Markov Property
2.2.6 Exponential Service Times
2.2.7 Foundation of the M/M/l Queueing System
2.2.8 Flows and Balancing
2.2.9 The M/M/l Queueing System in Detail
2.3 Little's Law
2.4 Reversibility and Burke's Theorem
2.4.1 Introduction
2.4.2 Reversibility
2.4.3 Burke's Theorem
2.5 The State Dependent M/M/l Queueing System
2.5.1 The General Solution
2.5.2 Performance Measures
2.6 The M/M/l/N Queueing System

1
1
2
7
11

k
!'

15
15
18
19
23
25
27
28
28
31
39
46
51
51
52
56
56
56
60
62

2.7 The M/M/co Queueing System

2.8 The M/M/m Queueing System
2.9 The M/M/m/m Queue: A Loss System
2.10 The Central Server CPU Model
2.11 Transient Solution of the M/M/l/ Queueing System
2.11.1 The Technique
2.11.2 The Solution
2.11.3 Speeding Up the Computation
2.12 The M/G/l Queueing System
2.12.1 Introduction
2.12.2 Mean Number in the Queueing System
2.12.3 Why We Use Departure Instants
2.12.4 Probability Distribution
To Look Further
Problems
Chapter 3: Networks of Queues
3.1 Introduction
3.2 The Product Form Solution
3.2.1 Introduction
3.2.2 Open Networks
3.2.2.1 The Global Balance Equation
3.2.2.2 The Traffic Equations
3.2.2.3 The Product Form Solution

3.2.3 Local Balance

3.2.4 Closed Queueing Networks
3.2.5 The BCMP Generalization
3.3 Algebraic Topological Interpretation of P.F. Solution
3.3.1 Introduction
3.3.2 A First Look at Building Blocks
3.3.3 Building Block Circulatory Structure
3.3.4 The Consistency Condition
3.4 Recursive Solution of Non-Product Form Networks
3.4.1 Introduction
3.4.2 Recursive Examples
3.4.3 Numerical Implementation of the Equations
3.5 Case Study I: Queueing on a Space Division (Packet Switch.
3.5.1 Introduction
\
3.5.2 Output Queueing
3.5.3 Input Queueing
3.6 Case Study II: Queueing on a Single-Buffered Banyan
Network
3.6.1 Introduction

65
67
70
72
74
74
75
79
81
81
81
90
92
97
99

103
104
104
104
104
106
107

Ill
112
115
117
117
117
122
136
139
139
143
148
151
151
152
157
161
161

3.6.2 The Model Assumptions

3.6.3 The Model and Solution
3.7 Case Study III: DQDB Erasure Station Location
3.7.1 Introduction
3.7.2 Optimal Location of Erasure Nodes
By M.W. Garrett and S.-Q. Li
To Look Further
Problems

164
165
167
167
171
176
177

Chapter 4: Numerical Solution of Models

4.1 Introduction
181
4.2 Closed Networks: Convolution Algorithm
182
4.2.1 Lost in the State Space
182
4.2.2 Convolution Algorithm: Single Customer Class
184
4.2.3 Performance Measures from Normalization Constants .. 188
Example 1: State Independent Servers
195
Example 2: State Independent Servers
200
Example 3: State Dependent Servers
207
4.3 Mean Value Analysis
213
4.3.1 State (Load) Independent Servers
213
Examples of the Use of the MVA Algorithm
214
Example 1: M Cyclic Queues
214
Example 2: Cyclic Queueing Network Numerical Example
216
4.4 PANACEA: Approach for Large Markovian Queueing
Networks
218
4.4.1 Introduction
218
4.4.2 The Product Form Solution
218
4.4.3 Conversion to Integral Representation
220
4.4.4 Performance Measures
223
4.4.5 "Normal Usage"
224
4.4.6 Some Transformations
224
4.4.7 Asymptotic Expansions
226
4.4.8 The Pseudonetworks
228
4.4.9 Error Analysis
230
4.5 Discrete Time Queueing Systems
230
4.6 Simulation of Communication Networks
234
By J.F. Kurose and H.T. Mouftah
\
4.6.1 Introduction
'
234
4.6.2 The Statistical Nature of a Simulation
235
4.6.3 Sensitivity Analysis of Simulation Results
237
4.6.4 Speeding Up a Simulation
239
To Look Further
242
Problems
244

Chapter 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 Alternating Bit Protocol
5.7 Conclusion
To Look Further

249
250
257
262
266
269
270
270

Appendix: Probability Theory Review

A.I Probability
A.2 Densities and Distribution Functions
A.3 Joint Densities and Distributions
A.4 Expectations
A.5 Convolution
A.6 Combinatorics

273
274
276
277
278
279

References

281