Some explicit formulas for mixed exponential service systems

Some explicit formulas for mixed exponential service systems

0.00 Avg rating0 Votes
Article ID: iaor1988124
Country: United Kingdom
Volume: 15
Start Page Number: 509
End Page Number: 520
Publication Date: Dec 1988
Journal: Computers and Operations Research
Authors:
Keywords: queues: theory
Abstract:

The paper presents some explicit formulas for queue length and waiting time distributions of customers in the M/HEm/1 queue. The formulas are obtained with the aid of roots of quadratic, cubic, and quartic polynomials constructed from a recurrence equations. With an example, the paper demonstrates 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 in 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.

Reviews

Required fields are marked *. Your email address will not be published.