| |
| |
Preface | |
| |
| |
Why Are We Here? | |
| |
| |
Sample Paths | |
| |
| |
The Case of the Copy Enlargement | |
| |
| |
Notation and Review | |
| |
| |
Sample-Path Decomposition | |
| |
| |
Simulating the Self-Service System | |
| |
| |
Simulating the Full-Service System | |
| |
| |
Discussion | |
| |
| |
Exercises | |
| |
| |
Basics | |
| |
| |
Probability | |
| |
| |
Random Variables | |
| |
| |
Joint Distributions | |
| |
| |
Expected Value | |
| |
| |
Conditional Probability | |
| |
| |
Limit Distributions | |
| |
| |
Statistics | |
| |
| |
Random-Variate Generation | |
| |
| |
The Case of the Copy Enlargement, Revisited | |
| |
| |
Fine Points | |
| |
| |
Exercises | |
| |
| |
Simulation | |
| |
| |
The Case of the Leaky Bit Bucket | |
| |
| |
Notation and Review | |
| |
| |
Stochastic Processes | |
| |
| |
Simulating the Leaky Bit Bucket | |
| |
| |
A Generic Stochastic-Process Model | |
| |
| |
Simulating the Copy Enlargement | |
| |
| |
Simulation Programming | |
| |
| |
Fine Points | |
| |
| |
Exercises | |
| |
| |
Arrival-Counting Processes | |
| |
| |
The Case of the Reckless Beehunter | |
| |
| |
Notation and Review | |
| |
| |
A Generic Arrival-Counting-Process Model | |
| |
| |
Simulating the Reckless Beehunter | |
| |
| |
The Poisson Arrival Process | |
| |
| |
Probability Structure of the Sample Paths | |
| |
| |
Parameterizing Poisson Processes | |
| |
| |
More about Poisson Arrival Processes | |
| |
| |
Decomposition of a Poisson Process | |
| |
| |
Superposition of Poisson Processes | |
| |
| |
Nonstationary Poisson Processes | |
| |
| |
The Case of the Meandering Message | |
| |
| |
Derivations | |
| |
| |
Memoryless Property | |
| |
| |
Independent-Increments and Stationary-Increments Properties | |
| |
| |
Decomposition Property | |
| |
| |
Superposition Property | |
| |
| |
Nonstationary Poisson Process | |
| |
| |
Results for the Renewal Arrival-Counting Process | |
| |
| |
The Case of the Perpetual Payoff | |
| |
| |
Derivations | |
| |
| |
Other Arrival-Counting Processes | |
| |
| |
Fine Points | |
| |
| |
Exercises | |
| |
| |
Discrete-Time Processes | |
| |
| |
The Case of the Random Behavior | |
| |
| |
Notation and Review | |
| |
| |
Simulating the Random Behavior | |
| |
| |
Markov Chains | |
| |
| |
Probability Structure of the Sample Paths | |
| |
| |
Parameterizing Markov Chains | |
| |
| |
Transition Diagrams | |
| |
| |
The Case of the Defective Detective | |
| |
| |
Time-Dependent Performance Measures | |
| |
| |
Examples | |
| |
| |
Derivations | |
| |
| |
Time-Independent (Long-Run) Performance Measures | |
| |
| |
Classification of States | |
| |
| |
Performance Measures | |
| |
| |
Examples | |
| |
| |
Derivations | |
| |
| |
The Markov and Stationarity Properties Revisited | |
| |
| |
Fine Points | |
| |
| |
Exercises | |
| |
| |
Continuous-Time Processes | |
| |
| |
The Case of the Software Sellout | |
| |
| |
Notation and Review | |
| |
| |
Markov Chain Review | |
| |
| |
Properties of the Exponential and Geometric Distributions | |
| |
| |
Simulating the Software Sellout | |
| |
| |
Sample Paths of the Software Sellout | |
| |
| |
Markov Processes | |
| |
| |
Probability Structure of a Markov Process | |
| |
| |
Parameterizing Markov Processes | |
| |
| |
Analysis of Markov Process Sample Paths | |
| |
| |
Performance Measures | |
| |
| |
Time-Dependent Performance Measures | |
| |
| |
Time-Dependent Example | |
| |
| |
Time-Independent (Long-Run) Performance Measures | |
| |
| |
Time-Independent Example | |
| |
| |
Derivations | |
| |
| |
The Case of the Stressed-Out Student | |
| |
| |
The Markov and Stationarity Properties Revisited | |
| |
| |
Semi-Markov Processes | |
| |
| |
Fine Points | |
| |
| |
Exercises | |
| |
| |
Queueing Processes | |
| |
| |
The Case of the Last Parking Space on Earth | |
| |
| |
Notation and Review | |
| |
| |
Series and Recursions | |
| |
| |
Markov Process Review | |
| |
| |
A Queueing Model for the Last Parking Space on Earth | |
| |
| |
Markovian Queueing Processes | |
| |
| |
The Birth-Death Process | |
| |
| |
Performance Measures | |
| |
| |
Standard Formulations | |
| |
| |
Arrival Rates | |
| |
| |
Service Rates | |
| |
| |
Parameterizing Queueing Processes | |
| |
| |
Shorthand Notation and Examples | |
| |
| |
The M/M/s Queue | |
| |
| |
The M/M/s/n/k Queue with s = n | |
| |
| |
The Case of the Tardy Ticket | |
| |
| |
Networks of Markovian Queues | |
| |
| |
The Case of the Incredible Shrinking Leviathan | |
| |
| |
Markov Process Model of the Incredible Shrinking Leviathan | |
| |
| |
Open Jackson Networks | |
| |
| |
Non-Markovian Queues and Networks | |
| |
| |
A GI/G/s Approximation | |
| |
| |
A Queueing-Network Approximation | |
| |
| |
Exercises | |
| |
| |
Topics in Simulation of Stochastic Processes | |
| |
| |
Statistical Issues in Simulation | |
| |
| |
Initial-Condition Effects | |
| |
| |
Measures of Error | |
| |
| |
Random Number Assignment | |
| |
| |
Rough-Cut Modeling | |
| |
| |
Exercises | |
| |
| |
Simulation Programming Examples | |
| |
| |
Fortran | |
| |
| |
SLAM II | |
| |
| |
SIMAN IV | |
| |
| |
GPSS/H | |
| |
| |
References | |
| |
| |
Index | |