On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough

DOI10.1007/s11134-009-9133-xzbMath1181.90073DBLPjournals/questa/GuptaHDZ10OpenAlexW2154614311WikidataQ56753438 ScholiaQ56753438MaRDI QIDQ849297

Mor Harchol-Balter, J. G. Dai, Varun Gupta, Bert Zwart

Publication date: 25 February 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-009-9133-x

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Breaking the dimensionality curse in multi-server queues ⋮ On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems ⋮ A multi-station system for reducing congestion in high-variability queues ⋮ Exact results for the order picking time distribution under return routing ⋮ Perfect simulation of M/G/c queues ⋮ Minimising average passenger waiting time in personal rapid transit systems ⋮ Steady state approximations of limited processor sharing queues in heavy traffic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison conjectures about the M/G/s queue
• A numerical solution for the multi-server queue with hyper-exponential service times
• Structural interpretation and derivation of necessary and sufficient conditions for delay moments in FIFO multiserver queues
• Conditional PASTA
• Approximations for multi-server queues: System interpolations
• New bounds for expected delay in FIFO GI/GI/\(c\) queues
• Heavy tails in multi-server queue
• A semidefinite optimization approach to the steady-state analysis of queueing systems
• A note on the convexity of performance measures of M/M/c queueing systems
• Some comparability results for waiting times in single- and many-server queues
• The queue GI/M/s with customers of different types or the queue GI/H_m/s
• The queue GI/H_m/s in continuous time
• On Approximations for Queues, I: Extremal Distributions
• Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
• The queue GI/GI/k: finite moments of the cycle variables and uniform rates of convergence
• Refining the Diffusion Approximation for the M/G/m Queue
• Approximations of the Mean Waiting Time in an M/G/s Queueing System
• The effect of variability in the GI/G/s queue
• Approximations for the steady-state probabilities in theM/G/cqueue
• The steady-state solution of the M/K₂/m queue
• Some Approximate Equilibrium Results for the Multi-Server Queue (M/G/r)^*
• Approximations for M/G/s queues
• AN APPROXIMATION FORMULA FOR THE MEAN WAITING TIME OF AN M/G/c QUEUE
• Approximations for the M/G/m Queue
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• A Light-Traffic Theorem for Multi-Server Queues
• Diffusion Approximation for an M/G/m Queue
• Heavy traffic theory for queues with several servers. I
• Approximation of the Mean Queue Length of an M/G/c Queueing System
• A Diffusion Approximation for the G/GI/n/m Queue

This page was built for publication: On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough