Fundamentals of Queueing Theory
by John F. Shortle, James M. Thompson, Donald Gross
5th Edition
Publisher: Wiley-Blackwell
Book Details
| Print ISBN | 9781118943526 |
| eText ISBN | 9781118943533 |
| Publisher | Wiley-Blackwell |
| Publishing Year | 2018 |
| Edition | 5th Edition |
| Language | English |
| Pages | 576 |
*Fundamentals of Queueing Theory, 5th Edition*, presents the statistical principles and processes involved in queueing analysis. The textbook connects mathematical theory with practical applications across computer science, engineering, business, and operations research.
Coverage spans stochastic processes, simple and advanced Markovian queueing models, network systems, and configurations with general arrival or service patterns. The text also investigates performance bounds, numerical approximations, and simulation techniques.
Intended for advanced undergraduate and graduate-level courses, the volume includes classroom-tested exercises at the end of each chapter. It also serves as a professional reference for practitioners in applied mathematics, operations research, and engineering.
Table of Contents
Chapter 1: Introduction
- • 1.1 Measures of System Performance
- • 1.2 Characteristics of Queueing Systems
- • 1.3 The Experience of Waiting
- • 1.4 Little’s Law
- • 1.5 General Results
- • 1.6 Simple Bookkeeping for Queues
- • 1.7 Introduction to the QtsPlus Software
- • Problems
Chapter 2: Review of Stochastic Processes
- • 2.1 The Exponential Distribution
- • 2.2 The Poisson Process
- • 2.3 Discrete-Time Markov Chains
- • 2.4 Continuous-Time Markov Chains
- • Problems
Chapter 3: Simple Markovian Queueing Models
- • 3.1 Birth-Death Processes
- • 3.2 Single-Server Queues (M=M=1)
- • 3.3 Multiserver Queues (M=M=c)
- • 3.4 Choosing the Number of Servers
- • 3.5 Queues with Truncation (M=M=c=K)
- • 3.6 Erlang’s Loss Formula (M=M=c=c)
- • 3.7 Queues with Unlimited Service (M=M=1)
- • 3.8 Finite-Source Queues
- • 3.9 State-Dependent Service
- • 3.10 Queues with Impatience
- • 3.11 Transient Behavior
- • 3.12 Busy-Period Analysis
- • Problems
Chapter 4: Advanced Markovian Queueing Models
- • 4.1 Bulk Input (M[X]=M=1)
- • 4.2 Bulk Service (M=M[Y ]=1)
- • 4.3 Erlang Models
- • 4.4 Priority Queue Disciplines
- • 4.5 Retrial Queues
- • Problems
Chapter 5: Networks, Series, and Cyclic Queues
- • 5.1 Series Queues
- • 5.2 Open Jackson Networks
- • 5.3 Closed Jackson Networks
- • 5.4 Cyclic Queues
- • 5.5 Extensions of Jackson Networks
- • 5.6 NonJackson Networks
- • Problems
Chapter 6: General Arrival or Service Patterns
- • 6.1 General Service, Single Server (M=G=1)
- • 6.2 General Service, Multiserver (M=G=c=_,M=G=1)
- • 6.3 General Input (G=M=1, G=M=c)
- • Problems
Chapter 7: General Models and Theoretical Topics
- • 7.1 G=Ek=1, G[k]=M=1, and G=PHk=1
- • 7.2 General Input, General Service (G=G=1)
- • 7.3 Poisson Input, Constant Service, Multiserver (M=D=c)
- • 7.4 Semi-Markov and Markov Renewal Processes in Queueing
- • 7.5 Other Queue Disciplines
- • 7.6 Design and Control of Queues
- • 7.7 Statistical Inference in Queueing
- • Problems
Chapter 8: Bounds and Approximations
- • 8.1 Bounds
- • 8.2 Approximations
- • 8.3 Deterministic Fluid Queues
- • 8.4 Network Approximations
- • Problems
Chapter 9: Numerical Techniques and Simulation
- • 9.1 Numerical Techniques
- • 9.2 Numerical Inversion of Transforms
- • 9.3 Discrete-Event Stochastic Simulation
- • Problems
Chapter Appendix A: Symbols and Abbreviations
Chapter Appendix B: Tables
Chapter Appendix C: Transforms and Generating Functions
- • C.1 Laplace Transforms
- • C.2 Generating Functions
Chapter Appendix D: Differential and Difference Equations
- • D.1 Ordinary Differential Equations
- • D.2 Difference Equations
Chapter Appendix E: QtsPlus Software
- • E.1 Instructions for Downloading
Customer Reviews
0.0
0 reviews
No reviews yet. Be the first to review this book!
Write a Review
Reviewed by GradeFocus Editorial Team
