| List of Figures | p. xv |
| Introduction | p. 1 |
| Queueing Model Parameters | p. 2 |
| A Simple Queueing Model | p. 3 |
| Some Basic Queueing Models | p. 7 |
| A Summary of the Contents | p. 7 |
| Basic Queueing Theory: Fundamentals of Analyzing Single Queues | p. 9 |
| Markov Processes and Markov Chains | p. 9 |
| Birth-Death Processes | p. 15 |
| Kendall's Notation for Queues | p. 20 |
| Little's Result | p. 22 |
| Equilibrium Solutions for M/M/-/- Queues | p. 23 |
| Delay Analysis for FCFS M/M/1/[infinity] and M/M/m/[infinity] Queues | p. 34 |
| Departure Process from a M/M/m/[infinity] Queue | p. 38 |
| Time Reversibility Property of Irreducible, Aperiodic Markov Chains | p. 40 |
| The Method of Stages for Solving a M/-/1/[infinity] FCFS Queue | p. 41 |
| Queues with Bulk (or Batch) Arrivals | p. 45 |
| Problems | p. 49 |
| Analysis of the M/G/1 Queue in Equilibrium: Performance Analysis Using Residual Life and Imbedded Markov Chain Approaches | p. 55 |
| The Residual Life Approach for Analysing the M/G/1 Queue | p. 57 |
| The Imbedded Markov Chain Approach for Analysing the M/G/1 Queue | p. 64 |
| Distributions of Time Spent in System and the Waiting Time Prior to Service in a FCFS M/G/1 Queue | p. 70 |
| Busy Period Analysis of a M/G/1 Queue | p. 72 |
| Delay Analysis for a LCFS M/G/1 Queue | p. 76 |
| The M/D/1 Queue | p. 79 |
| Alternative Derivation for the Delays in a FCFS M/G/1 Queue | p. 81 |
| Problems | p. 86 |
| Advanced Queueing Theory: Vacations, Bulk Arrivals and Priorities in a M/G/1 Queue and the Geo/G/1 Queue | p. 89 |
| M/G/1 Queue with Vacations | p. 90 |
| M/G/1 Queue with Only One Vacation after Idle | p. 97 |
| M/G/1 Queue with Exceptional First Service | p. 98 |
| M[superscript [X]/G/1 Queue - Single Server Queue with Batch Arrivals | p. 101 |
| Single Server M/G/1 Priority Queues | p. 106 |
| The Discrete Time Geo/G/1 and Geo[superscript [X]/G/1 Queues | p. 127 |
| Problems | p. 140 |
| Fundamentals of Queueing Networks: Open and Closed Networks with Product-Form Solutions | p. 143 |
| Classification of Different Types of Queueing Networks | p. 145 |
| Probabilistic Routing in a Queueing Network | p. 148 |
| Open Networks of M/M/m Type Queues and Jackson's Theorem | p. 150 |
| Extensions to Jackson's Theorem for Other Open Networks | p. 161 |
| Closed Queueing Networks | p. 164 |
| Convolution Algorithm for Finding the Normalisation Constant for a Closed Queueing Network | p. 172 |
| Mean Value Analysis (MVA) Algorithm for a Closed Queueing Network | p. 174 |
| Analysis of a Sample Closed Network Using Convolution and MVA Algorithms | p. 181 |
| Norton's Theorem for Closed Queueing Networks | p. 184 |
| Problems | p. 189 |
| Advanced Queueing Networks: Approximation Techniques for Open and Closed Queueing Networks | p. 193 |
| Mixed Queueing Networks | p. 193 |
| The GI/G/m Approximation for the Approximate Analysis of Open Queueing Networks (the QNA Technique) | p. 198 |
| Fork/Join Queues in Open and Closed Networks of Infinite Capacity Queues | p. 211 |
| Models of Blocking in Open and Closed Networks of Finite Capacity Queues | p. 218 |
| Approximate Analytical Methods for Solving Closed Networks of Finite Capacity Queues | p. 221 |
| Approximate Analytical Methods for Solving Open Networks of Finite Capacity Queues | p. 234 |
| The Generalised Exponential Distribution | p. 254 |
| Simulation Techniques for Queues and Queueing Networks: Basic Principles for the Design of Queueing Simulators | p. 257 |
| Simulation Model of a Real World System | p. 258 |
| Discrete Event Simulation | p. 263 |
| Collecting and Processing Simulator Outputs for Queues | p. 268 |
| Estimation of Confidence Intervals and Confidence Levels | p. 271 |
| Transient Behaviour and the Warm-up Interval | p. 274 |
| Data Collection in Steady State Conditions | p. 275 |
| Generating Random Numbers | p. 280 |
| References | p. 283 |
| Index | p. 285 |
| Table of Contents provided by Syndetics. All Rights Reserved. |