Introduction | p. 11.1 |
Role of Modeling and Analysis | p. 11.2 |
Performance Measures | p. 71.3 |
Modeling Approaches | p. 91.4 |
Examples of Performance Modeling | p. 161.5 |
Discussion and Further Reading | p. 38I |
Basic Queueing and Loss Models | p. 392 |
Basic Queueing Models | p. 402.1 |
Introduction | p. 402.2 |
Little's Formula and Its Generalization | p. 462.3 |
Birth-and-Death Processes | p. 522.4 |
Birth-and-Death Queueing Models | p. 682.5 |
Discussion and Further Reading | p. 933 |
Basic Loss Models | p. 953.1 |
Erlang Loss Model: M/M/m(0) or M/M/m/m | p. 953.2 |
Engset Loss Model: M(K)/M/m(0) or M/M/m/m/K | p. 1033.3 |
Insensitivity and Generalization of Loss Models | p. 1113.4 |
Application Example: Blocking Analysis of Cellular CommunicationSystems | p. 1123.5 |
Discussion and Further Reading | p. 1234 |
Non-Markovian Queues | p. 1244.1 |
Renewal Process and Residual Life | p. 1244.2 |
Representations of General Distributions | p. 1294.3 |
M/G/1 Queueing Model | p. 1394.4 |
G/M/1 Queueing Model | p. 1594.5 |
G/G/1 Queue and Waiting Time Distribution | p. 1694.6 |
Discussion and Further Reading | p. 1755 |
Quasi-Reversibility and Queues with Product-Form Solutions | p. 1775.1 |
Markov Processes and Markov Chains | p. 1775.2 |
Departure Processes, Reversibility and Quasi-Reversibility | p. 1885.3 |
M/G/1 Queueing Model | p. 2085.4 |
M/G/1 with Processor Sharing | p. 2135.5 |
M/G/1 with LCFS | p. 2185.6 |
M/G/1 with LCFS-PR | p. 2205.7 |
Multiple Customer Classes and Quasi-Reversible Stations | p. 2215.8 |
Discussion and Further Reading | p. 233II Queuei |
Queueing Networks | p. 2366.1 |
Introduction | p. 2366.2 |
Jackson Networks: Queueing Networks with Exponential Servers | p. 2386.3 |
Networks with Quasi-Reversible Stations and Multiple Classes ofCustomers | p. 2766.4 |
Higher-Order Markov Routing | p. 2876.5 |
Discussion and Further Reading | p. 2957 |
Loss Networks and Generalized Loss Models | p. 2977.1 |
Introduction | p. 2977.2 |
Generalized Loss Stations | p. 2987.3 |
Loss Networks with Fixed Routing | p. 3107.4 |
Queueing-Loss Networks | p. 3347.5 |
Discussion and Further Reading | p. 3368 |
Computational Algorithms for Product-Form Networks | p. 3388.1 |
Introduction | p. 3388.2 |
Computational Algor | |
Table of Contents provided by Publisher. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.