Aviso: Por labores de mantenimiento y mejora del repositorio, el martes día 1 de Julio, Docta Complutense no estará operativo entre las 9 y las 14 horas. Disculpen las molestias.
 

The busy period and the waiting time analysis of a MAP/M/c queue with finite retrial group

Simple item page
dc.contributor.authorArtalejo Rodríguez, Jesús Manuel
dc.contributor.authorChakravarthy, S. R.
dc.contributor.authorLópez Herrero, María Jesús
dc.date.accessioned2023-06-20T09:35:22Z
dc.date.available2023-06-20T09:35:22Z
dc.date.issued2007-03-07
dc.descriptionJ. R. Artalejo and M. J. Lopez-Herrero thank the support received from the research project MTM2005-01248.
dc.description.abstractWe concentrate on the analysis of the busy period and the waiting time distribution of a multi-server retrial queue in which primary arrivals occur according to a Markovian arrival process (MAP). Since the study of a model with an infinite retrial group seems intractable, we deal with a system having a finite buffer for the retrial group. The system is analyzed in steady state by deriving expressions for (a) the Laplace–Stieltjes transforms of the busy period and the waiting time; (b) the probabiliy generating functions for the number of customers served during a busy period and the number of retrials made by a customer; and (c) various moments of quantites of interest. Some illustrative numerical examples are discussed.
dc.description.departmentDepto. de Estadística e Investigación Operativa
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/15473
dc.identifier.doi10.1080/07362990601139651
dc.identifier.issn0736-2994
dc.identifier.officialurlhttp://www.tandfonline.com/doi/pdf/10.1080/07362990601139651
dc.identifier.relatedurlhttp://www.tandfonline.com/
dc.identifier.urihttps://hdl.handle.net/20.500.14352/49977
dc.issue.number2
dc.journal.titleStochastic Analysis and Applications
dc.language.isoeng
dc.page.final469
dc.page.initial445
dc.publisherTaylor & Francis Inc
dc.relation.projectIDMTM2005-01248
dc.rights.accessRightsopen access
dc.subject.cdu519.8
dc.subject.keywordBusy period
dc.subject.keywordMarkovian arrival process
dc.subject.keywordMulti-server queue
dc.subject.keywordRetrials
dc.subject.keywordWaiting time
dc.subject.ucmInvestigación operativa (Matemáticas)
dc.subject.unesco1207 Investigación Operativa
dc.titleThe busy period and the waiting time analysis of a MAP/M/c queue with finite retrial group
dc.typejournal article
dc.volume.number25
dcterms.referencesFalin, G.I., and Templeton, J.G.C. 1997. Retrial Queues. Chapman and Hall, London. Kosten, L. 1973. Stochastic Theory of Service Systems. International Series of Monographs in Pure and Applied Mathematics. Vol. 103, Pergamon Press, Oxford. Neuts, M.F., and Rao, B.M. 1990. Numerical investigation of a multiserver retrial model. Queueing Systems 7:169–190. Choi, B.D., and Chang, Y. 1999. MAP1, MAP2/M/c with retrial queue with the retrial group of finite capacity and geometric loss. Mathematical and Computer Modelling 30:99–113. Diamond, J.E., and Alfa, A.S. 1999. Matrix-analytic methods for a multiserver retrial queue with buffer. Top 7:249–266. Breuer, L., Dudin, A.N., and Klimenok, V.I. 2002. A retrial BMAP/PH/N system. Queueing Systems 40:433–457. Chakravarthy, S.R., Krishnamoorthy, A., and Joshua, V.C. 2006. Analysis of a multi-server queue with search of customers from the orbit. Performance Evaluation 63:776–798. Gomez-Corral, A. 2006. A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Annals of Operations Research 141:163–191. Artalejo, J.R., Economou, A., and Lopez-Herrero, M.J. 2005. Algorithmic analysis for the number of customers served in a busy period of the M/M/c retrial queue. In Proceedings of the National Conference on Mathematical and Computational Models, December 15–16, Coimbatore, India. Arumugnathan, R., and Nadarajan, R. (Eds.), Allied Publishers, New Delhi, 3–15. Artalejo, J.R., and Gomez-Corral, A. 2005. Waiting time in the M/M/c queue with finite retrial group. Bulletin of Kerala Mathematics Association 2:1–17. Artalejo, J.R., Economou, A., and Lopez-Herrero, M.J. 2007. Algorithmic approximations for the busy period of the M/M/c retrial queue. European Journal of Operational Research 176:1687–1702. Artalejo, J.R., and Lopez-Herrero, M.J. 2007. On the distribution of the number of retrials. Applied Mathematical Modelling 31:478–489. Artalejo, J.R., and Chakravarthy, S.R. 2006. Computational analysis of the maximal queue length in the MAP/M/c retrial queue. Applied Mathematics and Computation 183:1399–1409. Marcus, M., and Minc, H. 1964. A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston, MA. Lucantoni, D.M. 1991. New results on the single server queue with a batch Markovian arrival process. Stochastic Models 7:1–46. Downloaded by [Biblioteca Universidad Complutense de Madrid] at 02:17 14 March 2012 Neuts, M.F. 1992. Models based on the Markovian arrival process. IEICE Transactions on Communications E75B:1255–1265. Chakravarthy, S.R. 2001. The batch Markovian arrival process: A review and future work. In Advances in Probability Theory and Stochastic Processes. Krishnamoorthy, A., et al. (Eds.), Notable Publications Inc., New Jersey, 21–39.
dspace.entity.typePublication
relation.isAuthorOfPublicationdb4b8a04-44b0-48e9-8b2c-c80ffae94799
relation.isAuthorOfPublication64a702cc-f8f5-468f-baeb-e37e92492a68
relation.isAuthorOfPublication.latestForDiscovery64a702cc-f8f5-468f-baeb-e37e92492a68

Download

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
arta26.pdf
Size:
294.72 KB
Format:
Adobe Portable Document Format
downoload Download

Collections

Artículos