2026-06-29T07:44:25Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/499872024-03-11T14:15:24Zcom_20.500.14352_14col_20.500.14352_15

Algorithmic Analysis of the MAP/PH/1 Retrial Queue Artalejo Rodríguez, Jesús Manuel Chakravarthy, S. R. 519.8 Markovian arrival process retrial busy period queueing maximal queue length phase type distribution and algorithmic probability Investigación operativa (Matemáticas) 1207 Investigación Operativa The authors thank an anonymous referee for his/her constructive comments on an earlier version of the paper. The first author thanks the support received from the research project MTM2005-01248. This research was conducted while the second author was visiting the Complutense University of Madrid, Madrid, Spain, and would like to thank the hospitality of the Department of Statistics and Operations Research. In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented. Depto. de Estadística e Investigación Operativa Fac. de Ciencias Matemáticas TRUE pub 2023-06-20T09:35:37Z 2023-06-20T09:35:37Z 2006-12 journal article https://hdl.handle.net/20.500.14352/49987 1134-5764 10.1007/BF02837565 eng MTM2005-01248 restricted access application/pdf Springer