An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
From MaRDI portal
Publication:2890416
DOI10.1287/IJOC.1030.0045zbMath1239.90033OpenAlexW2104293546MaRDI QIDQ2890416
Denise M. Bevilacqua Masi, Martin J. Fischer, Donald Gross, John F. Shortle, Percy H. Brill
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0045
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (16)
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ On the Laplace transform of the Pareto distribution ⋮ Analytical and computational studies of the BMAP/G(a,Y)/1 queue ⋮ Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system ⋮ On the accuracy of phase-type approximations of heavy-tailed risk models ⋮ Bayesian inference for double Pareto lognormal queues ⋮ Laplace Transforms of Probability Distributions and Their Inversions are Easy on Logarithmic Scales ⋮ Importance of verifying queue model assumptions before planning with simulation software ⋮ A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X}/ \text{C-MSP} / 1\) queueing system] ⋮ Modelling and analysis of \(GI/BMSP/1\) queueing system ⋮ Exact waiting time and queue size distributions for equilibrium \(M/G/1\) queues with Pareto service ⋮ A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)] ⋮ PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS ⋮ The distribution of compound sums of Pareto distributed losses ⋮ Bayesian Analysis of a Queueing System with a Long-Tailed Arrival Process ⋮ An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials
This page was built for publication: An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
