Some explicit formulas for mixed exponential service systems
We present some explicit formulas for queue length and waiting time distributions of customers in the \(M/HE_ m/1\) queue. The formulas are obtained with the aid of roots of quadratic, cubic, and quartic polynomials constructed from a recurrence equation. With an example, we demonstrate that the formulas for queueing distributions are extremely accurate, while the corresponding infinite history M/GI/1 recurrence equation is not. Applications include computation of queueing distributions, accurate tail probabilities, and systems where exponentiality can be replaced by hyperexponentiality. The explicit solutions are easier to use than the problem-specific partial fraction expansions of the Pollachek-Khinchin transform.
- A numerical solution for the multi-server queue with hyper-exponential service times
- Analysis of queues with hyperexponential arrival distributions
- scientific article; zbMATH DE number 2077520
- Exact waiting time and queue size distributions for equilibrium \(M/G/1\) queues with Pareto service
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- A characterization of the gamma distribution by the negative binomial distribution
- A conservation law for a wide class of queueing disciplines
- A relation between stationary queue and waiting time distributions
- Characterizations of equilibrium queue length distributions in M/GI/1 queues
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 3626393 (Why is no real title available?)
- scientific article; zbMATH DE number 3010997 (Why is no real title available?)
- Single server queues with hyperexponential service times
- Some explicit formulas for mixed exponential service systems
This page was built for publication: Some explicit formulas for mixed exponential service systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113220)