Heavy-traffic single-server queues and the transform method
From MaRDI portal
Publication:6135886
Abstract: Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let denote the steady-state waiting time in the queue. Kingman (1961) showed that , when appropriately scaled, converges in distribution to an exponential random variable as the system's load approaches 1. The original proof of this famous result uses the transform method. Starting from the Laplace transform of the pdf of (Pollaczek's contour integral representation), Kingman showed convergence of transforms and hence weak convergence of the involved random variables. We apply and extend this transform method to obtain convergence of moments with error assessment. We also demonstrate how the transform method can be applied to so-called nearly deterministic queues in a Kingman-type and a Gaussian heavy-traffic regime. We demonstrate numerically the accuracy of the various heavy-traffic approximations.
Recommendations
- Exponential approximation of waiting time and queue size for queues in heavy traffic
- Relating the waiting time in a heavy-traffic queueing system to the queue length
- Transform methods for heavy-traffic analysis
- A Light Traffic Approximation for a Single-Server Queue
- Heavy-traffic asymptotics for the single-server queue with random order of service
Cites work
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3206641 (Why is no real title available?)
- scientific article; zbMATH DE number 3185400 (Why is no real title available?)
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- Approximate stochastic behavior of n-server service systems with large n
- Complete corrected diffusion approximations for the maximum of a random walk
- Corrected diffusion approximations in certain random walk problems
- Cumulants of the maximum of the Gaussian random walk
- Heavy Traffic Limit Theorems for Queues: A Survey
- Heavy traffic theory for queues with several servers. I
- Heavy traffic theory for queues with several servers. II
- Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions
- Heavy-traffic limits for nearly deterministic queues
- Heavy-traffic limits for nearly deterministic queues: Stationary distributions
- Heavy-traffic single-server queues and the transform method
- Ladder heights, Gaussian random walks and the Riemann zeta function
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Novel heavy-traffic regimes for large-scale service systems
- On Lerch's transcendent and the Gaussian random walk
- Pollaczek contour integrals for the fixed-cycle traffic-light queue
- Robust heavy-traffic approximations for service systems facing overdispersed demand
- Some Inequalities for Parallel-Server Queues
- Stationary distribution convergence for generalized Jackson networks in heavy traffic
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
Cited in
(2)
This page was built for publication: Heavy-traffic single-server queues and the transform method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135886)
