Estimação da intensidade do tráfego em filas m/m/1/k utilizando o método do mínimo qui-quadrado

Abstract

In queuing theory, one of the researchers' main interests is to study their behavior, their training process and analyze some performance characteristics, such as, for example, the intensity of the traffic, defined as the ratio between arrival rate and the rate of care. However, it is known that most of the time the parameters involved in the process are not known and need to be estimated. This article aims to obtain estimates of traffic intensity in finite Markovian queues with a single server, named M / M / 1 / K, in Kendall's notation. For this we will use the estimation method of the chi-square minimum. A numerical example illustrates the procedure