A simulation algorithm for a single server retrial queuing system with batch arrivals

Ion Florea; Corina-Ştefania Nǎnǎu

doi:10.1515/auom-2015-0007

.blurhash-client-img { display: none !important; }

A simulation algorithm for a single server retrial queuing system with batch arrivals

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

Volume 23 (2015): Issue 1 (January 2015)

By: Ion Florea and Corina-Ştefania Nǎnǎu

Open Access

|Apr 2017

Abstract

Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases. The paper presents a study approach for this kind of systems, based on discrete event simulation. It is shown that the given algorithm has a polynomial complexity. Also, the object-oriented design we used for implementation is sketched.

References

[1] Artalejo, J.R. a.o., Retrial queuing systems: A computational approach, Springer, 2008.10.1007/978-3-540-78725-9
Search in Google Scholar Back to article
[2] Artalejo, J.R. a.o., Standard and retrial queuing systems: A comparative analysis, Matematica Complutense, vol. 15 (2002), no. 1, 101-129.
Search in Google Scholar Back to article
[3] Artalejo, J.R. a.o., On the Single Server Retrial Queue with Batch Arrivals, The Indian Journal of Statistics, Vol. 66 (2004), no. 1, 140-158.
Search in Google Scholar Back to article
[4] Choi, B,D. a.o., Retrial queues with collision arising from unslotted CSMA/CD protocol, Queueing Systems Theory Appl. (1992), 335-356.10.1007/BF01163860
Search in Google Scholar Back to article
[5] Cormen, T. H. a.o., Introduction to algorithms, MIT Press, Cambridge, 1992.
Search in Google Scholar Back to article
[6] Devroye, L., Non-uniforme random variate generation, Springer Verlag, New York, 1986.10.1007/978-1-4613-8643-8
Search in Google Scholar Back to article
[7] Falin, G.I. a.o, Retrial Queues, Chapman and Hall, London, 1997.10.1007/978-1-4899-2977-8
Search in Google Scholar Back to article
[8] Falin, G.I. a.o, A single-server batch arrival queue with returning customers, European Journal of Operational Research (2010), 186-179.10.1016/j.ejor.2009.03.033
Search in Google Scholar Back to article
[9] Florea, I., One algorithmic approach of first-come-first-served queuing systems, Bucharest University Annals, Informatics, 49 (2000), 41-58.
Search in Google Scholar Back to article
[10] Florea, I. a.o, An algorithmic approach of retrial queuing system with one serving station Part I: The description of the simulation algorithm, Bulletin of the Transilvania University of Braşov, Vol. 6(55) (2013), no. 2, 95-106.
Search in Google Scholar Back to article
[11] Gross, D. a.o., Fundamentals of queuing theory, fourth edition, John Wiley & Sons, 2008.
Search in Google Scholar Back to article
[12] Leahu, A., Statistical Inference on the Traffic Intensity for the M/M/s Queuing System, Analele Stiintifice ale Universitatii. Ovidius Constanţa, Vol. 11(1) (2003), no. 2, 101-104.
Search in Google Scholar Back to article
[13] Krishna, K. B. a.o., The M/G/1 retrial queue with Bernoulli schedules and general retrial times, Computers and Mathematics with Applications 43 (2002), 15-30.10.1016/S0898-1221(01)00267-X
Search in Google Scholar Back to article
[14] Nawel K. A. a.o., On the asymptotic behaviour of M/G/1 retrial queues with batch arrivals and impatience phenomenon, Mathematical and Computer Modelling (2012), 654665.
Search in Google Scholar Back to article
[15] Yamamuro K., The queue length in an M/G/1 batch arrival retrial queue, Queueing Syst (2012), 187205.10.1007/s11134-011-9268-4
Search in Google Scholar Back to article
[16] Yang, T. a.o. J.G.C, A survey on retrial queues, Queueing Systems Theory Appl (1987), 203-233.10.1007/BF01158899
Search in Google Scholar Back to article

Articles in this issue

DOI: https://doi.org/10.1515/auom-2015-0007 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784

Journal RSS Feed

Language: English

Page range: 83 - 98

Submitted on: May 8, 2014

Accepted on: Jun 30, 2014

Published on: Apr 4, 2017

Published by: Ovidius University of Constanta

In partnership with: Paradigm Publishing Services

Publication frequency: 3 issues per year

Keywords:

Retrial Queuing system,

Batch Arrivals,

Simulation Algorithm,

Polynomial Complexity

Related subjects:

Mathematics,

General mathematics

© 2017 Ion Florea, Corina-Ştefania Nǎnǎu, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 23 (2015): Issue 1 (January 2015)