Maximum entropy solution to a quorum queueing system

Authors:
L. Tadj;A. Hamdi
Affiliations:
Department of Statistics and Operations Research College of Science, King Saud University P.O. Box 2455, Riyadh 11451, Saudi Arabia;Department of Mathematics College of Science, King Saud University P.O. Box 2455, Riyadh 11451, Saudi Arabia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2001

Citing 3
Cited 1

The Fourier-series method for inverting transforms of probability distributions

Queueing Systems: Theory and Applications - Numerical computations in queues
Transform-free analysis of M / G / 1 / K and related queues

Mathematics of Operations Research
Queueing systems with state dependent parameters

Frontiers in queueing

Recursive solution to a quorum queueing system

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

For a quorum queueing system, the system size steady-state initial probability vector is usually found by solving a simple system of linear equations, but computation of the system size steady-state tail probability vector requires the inversion of the probability generating function. We use in this paper the initial probability vector to compute the mean system size and then, using the mean system size, we compute the maximum entropy approximation of the tail probability vector, thus avoiding inversion of the probability generating function. In a numerical example, comparison of the initial probability vectors obtained by the exact and approximate methods proved to be excellent. We also show how to compute the tail probability vector.