Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue

DOI10.1007/s11134-020-09649-9zbMath1434.90039OpenAlexW3007925440MaRDI QIDQ2306744

Yan Chen, Ward Whitt

Publication date: 26 March 2020

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

Full work available at URL: https://doi.org/10.1007/s11134-020-09649-9

zbMATH Keywords

single-server queuestochastic simulationtwo-point distributionextremal queuesbounds for the mean waiting time

Mathematics Subject Classification ID

Computational methods for problems pertaining to probability theory (60-08) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times ⋮ Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate ⋮ MAD Dispersion Measure Makes Extremal Queue Analysis Simple ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Heavy-traffic single-server queues and the transform method ⋮ Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fourier-series method for inverting transforms of probability distributions
• On the Lambert \(w\) function
• Engineering Solution of a Basic Call-Center Model
• Technical Note—Simulating the GI/G/1 Queue in Heavy Traffic
• On Approximations for Queues, I: Extremal Distributions
• On Approximations for Queues, II: Shape Constraints
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Deciding Which Queue to Join: Some Counterexamples
• Simple Inequalities for the D/G/1 Queue
• Inequalities for moments of tails of random variables, with a queueing application
• Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
• Idle period approximations and bounds for the GI/G/1 queue
• Applied Probability and Queues
• Some Inequalities in Queuing
• Some inequalities for the queue GI/G/1

This page was built for publication: Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue