PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS

DOI10.1081/STM-200046520zbMath1066.60087MaRDI QIDQ4678857

John F. Shortle

Publication date: 23 May 2005

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

numerical methods in queueing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

Modeling probability densities with sums of exponentials via polynomial approximation ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform ⋮ An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queue length distributions from probability generating functions via discrete Fourier transforms
• The Fourier-series method for inverting transforms of probability distributions
• Waiting-time tail probabilities in queues with long-tail service-time distributions
• Appendix: A primer on heavy-tailed distributions
• Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis
• An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
• Computing Laplace Transforms for Numerical Inversion Via Continued Fractions
• The Importance of Power-Tail Distributions for Modeling Queueing Systems

This page was built for publication: PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS