2026-06-08T14:03:53Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/1020852025-09-08T15:01:37Zcom_20.500.14352_14col_20.500.14352_15

A maximum entropy approach for the busy period of the M/G/1 retrial queue López Herrero, María Jesús Boros, Endre 519.6 Retrial queue Busy period Laplace transforms Maximum entropy principle Lagrange multipliers Análisis numérico 1206 Análisis Numérico This paper concerns the busy period of a single server queueing model with exponentially distributed repeated attempts. Several authors have analyzed the structure of the busy period in terms of the Laplace transform but, the information about the density function is limited to first and second order moments. We use the maximum entropy principle to find the least biased density function subject to several mean value constraints. We perform results for three different service time distributions: 3-stage Erlang, hyperexponential and exponential. Also a numerical comparative analysis between the exact Laplace transform and the corresponding maximum entropy density is presented. Depto. de Estadística y Ciencia de los Datos Fac. de Estudios Estadísticos TRUE pub 2024-03-09T11:26:36Z 2024-03-09T11:26:36Z 2006 journal article VoR https://hdl.handle.net/20.500.14352/102085 0254-5330 10.1007/s10479-006-5302-z 1572-9338 eng BFM2002–02189 Lopez-Herrero, M.J. A maximum entropy approach for the busy period of the M/G/1 retrial queue. Ann Oper Res 141, 271–281 (2006). open access application/pdf Springer