Simulation methods of queues: An overview
From MaRDI portal
Publication:1116204
DOI10.1007/BF01161216zbMath0665.60101OpenAlexW2034526654MaRDI QIDQ1116204
Peter W. Glynn, Donald L. Iglehart
Publication date: 1988
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01161216
perturbation analysisdiffusion approximationsqueueing systemssemi-Markov processaspects of simulation methodologyperformance parameterssteady-state quantities
Related Items (16)
Importance sampling for Jackson networks ⋮ Importance Sampling for Metastable and Multiscale Dynamical Systems ⋮ Monte Carlo methods for security pricing ⋮ Three-level modeling of a speed-scaling supercomputer ⋮ A Retrial Queueing System with Abandonment and Search for Priority Customers ⋮ Gradient estimates for the performance of Markov chains and discrete event processes ⋮ Decomposable score function estimators for sensitivity analysis and optimization of queueing networks ⋮ Sensitivity analysis of discrete event systems by the push out method ⋮ Efficiency improvement techniques ⋮ Parallel processors for planning under uncertainty ⋮ Laws of Large Numbers and Functional Central Limit Theorems for Generalized Semi-Markov Processes ⋮ Variance Reduction for Simulating Transient GI/G/1 Behavior ⋮ Branching Technique for Markov Chain Simulation (Finite State Case) ⋮ Modeling paradigms for discrete event simulation ⋮ Regenerative simulation of TES processes ⋮ Rare events in queueing systems -- A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate processes and the simulation of ruin problems
- Discrete-time conversion for simulating semi-Markov processes
- Importance sampling in the Monte Carlo study of sequential tests
- Technical Note—Simulating the GI/G/1 Queue in Heavy Traffic
- Approximation Theorems of Mathematical Statistics
- Simulating Average Delay–Variance Reduction by Conditioning
- Simulating GI/G/k Queues in Heavy Traffic
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- An LIL Version of L = λW
- Comparing stochastic systems using regenerative simulation with common random numbers
- Continuity of Generalized Semi-Markov Processes
- Statistical Results on Control Variables with Application to Queueing Network Simulation
- Efficient Estimators for Simulated Queueing Systems
- Discrete time methods for simulating continuous time Markov chains
- A New Approach to the Limit Theory of Recurrent Markov Chains
- Convergence Properties of Infinitesimal Perturbation Analysis Estimates
- Planning Queueing Simulations
- Some Relationships Between the Distributions of Waiting Time, Idle Time and Interoutput Time in the $GI/ G/1$ Queue
This page was built for publication: Simulation methods of queues: An overview
