Queue length distributions from probability generating functions via discrete Fourier transforms
DOI10.1016/0167-6377(89)90066-7zbMATH Open0671.60098OpenAlexW2076038467MaRDI QIDQ1119293FDOQ1119293
Authors: John Daigle 
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
Recommendations
- Numerical inversion of probability generating functions
- Computing distributions and moments in polling models by numerical transform inversion
- Multidimensional transform inversion with applications to the transient \(M/G/1\) queue
- scientific article; zbMATH DE number 2064354
- A DISCRETE QUEUE, FOURIER SAMPLING ON SZEGÖ CURVES AND SPITZER FORMULAS
queuesalgorithm for obtaining complete queue length distributionsinversion of probability generating functions
Characteristic functions; other transforms (60E10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Differentiation of Analytic Functions
- Title not available (Why is that?)
- Differentiation Formulas for Analytic Functions
- Title not available (Why is that?)
- Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods
- Numerical Differentiation of Analytic Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Method for Generating Power Series Expansions of Functions
- Title not available (Why is that?)
- A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
- 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
Cited In (9)
- Using cumulant functions in queueing theory
- Time-limited polling systems with batch arrivals and~phase-type service times
- Numerical inversion of probability generating functions
- A DISCRETE QUEUE, FOURIER SAMPLING ON SZEGÖ CURVES AND SPITZER FORMULAS
- PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS
- The Fourier-series method for inverting transforms of probability distributions
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
- Transient behavior of \(M/M^{ij}/1\) queues
This page was built for publication: Queue length distributions from probability generating functions via discrete Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119293)
