ANALYTICAL MOMENTS FOR TRAFFIC INTENSITY IN ERLANG QUEUES

Vol 56, 2024 - 309711
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract
Erlang single-server queueing systems generalize the Markovian single-server queues and are applicable in situations where the service times occur in multiple stages. A convenient sampling scheme for statistical estimation of parameters in these systems consists of observing the number of customers arriving during service times. However, the maximum likelihood estimator in these models is biased, especially for higher traffic intensities. In this context, this paper develops theoretical expressions for the bias and variance of the maximum likelihood estimator in Erlang queueing systems under this sampling scheme. The theoretical expressions were also analyzed in terms of numerical efficiency using classical Monte Carlo simulations. The results showed a significant reduction in computation time for the bias and variance when using the theoretical expressions.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal de Minas Gerais
Track
  • 9. EST&MP – Statistics and Probabilistic Models
Keywords
queuing theory
Erlang queues
inference