This is the authors' abstract. We don't add key points for this paper.
In this letter, we investigate the queue behavior with Pareto interarrival and exponential service time distribution. By numerical analysis and simulations, we analyze the asymptotic and the exact loss probabilities of GI/M/1/K to show the big discrepancy between the asymptotic and the actual loss probability and propose a model for the loss probability of Pareto/M/1/K as a function of the buffer size K and the geometric parameter.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Koh et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: