Queue length distributions from probability generating functions via discrete Fourier transforms
From MaRDI portal
Publication:1119293
DOI10.1016/0167-6377(89)90066-7zbMath0671.60098OpenAlexW2076038467MaRDI QIDQ1119293
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90066-7
queuesalgorithm for obtaining complete queue length distributionsinversion of probability generating functions
Characteristic functions; other transforms (60E10) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. ⋮ Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach ⋮ The Fourier-series method for inverting transforms of probability distributions ⋮ Numerical inversion of probability generating functions ⋮ Time-limited polling systems with batch arrivals and~phase-type service times ⋮ PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS ⋮ Transient behavior of \(M/M^{ij}/1\) queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
- Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods
- Numerical Differentiation of Analytic Functions
- Performance analysis of an optical disk-based office system under a mixed user operating strategy
- On the Fast Fourier Transform Inversion of Probability Generating Functions
- Numerical inversion of z-transforms with application to polymerization kinetics
- Numerical Differentiation of Analytic Functions
- A New Method for Generating Power Series Expansions of Functions
- Differentiation Formulas for Analytic Functions
