A carregar...
Publicação
Distribution of the Number of Losses in Busy-Periods of Mx/G/1/n Systems
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 160.1 KB | Adobe PDF |
Orientador(es)
Resumo(s)
This chapter addresses MX=G=1=n queues, i.e., single server batch Markovian arrival queues with finite customer waiting space of size n. Taking profit of the Markov regenerative structure of these systems, we develop an efficient recursive procedure to compute the probability mass function of the number of losses in busy-periods starting with an arbitrary number of customers in the system. The derived computational procedure is easy to implement and leads to a fast numerical computation of the loss probabilities. To illustrate the effectiveness of the procedure, loss probabilities are computed for a wide variety of queues, with different capacities, batch size distributions, and arrival and service parameters.
Descrição
Palavras-chave
Contexto Educativo
Citação
Ferreira, F., Pacheco, A., Ribeiro, H. (2013). Distribution of the Number of Losses in Busy-Periods of Systems. In: Lita da Silva, J., Caeiro, F., Natário, I., Braumann, C. (eds) Advances in Regression, Survival Analysis, Extreme Values, Markov Processes and Other Statistical Applications. Studies in Theoretical and Applied Statistics(). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34904-1_17
Editora
Springer
Coleções
Licença CC
Sem licença CC