The approximation of the loss probability in finite-buffer queues is a practical problem of considerable interest. A new heuristic is given. This heuristic is based on the equilibrium distribution of the corresponding infinite-buffer queue. Numerical results show an excellent performance of the heuristic.
No takes yet. Share an insight, caveat, or question.
Henk Tijms (1992) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: