Analysis of a multi-server retrial queue with a varying finite number of sources

Ciro D'Apice; Alexander Dudin; Sergei Dudin; Rosanna Manzo; Ciro D'Apice; Alexander Dudin; Sergei Dudin; Rosanna Manzo

doi:10.3934/math.20241592

AIMS Mathematics

2024, Volume 9, Issue 12: 33365-33385. doi: 10.3934/math.20241592

Previous Article Next Article

Research article Special Issues

Analysis of a multi-server retrial queue with a varying finite number of sources

1.
Dipartimento di Scienze Aziendali - Management & Innovation Systems, University of Salerno, Via Giovanni Paolo II, 132, Fisciano 84084, Salerno, Italy
2.
Department of Applied Mathematics and Computer Science, Belarusian State University, 4, Nezavisimosti Ave., 220030 Minsk, Belarus
3.
Department of Political and Communication Sciences, University of Salerno, Via Giovanni Paolo II, 132, Fisciano 84084, Salerno, Italy

Received: 17 October 2024 Revised: 05 November 2024 Accepted: 11 November 2024 Published: 25 November 2024
MSC : 60K25, 60K30, 60M20

A multi-server retrial queue with a finite number of sources of requests was considered. In contrast to similar models studied in the literature, we assumed this number is not constant but changes its value in a finite range. During the stay in the system, each source generates the service requests. These requests are processed in a finite pool of servers. After service completion of a request, the source is granted the possibility to generate another request. If the source does not use this possibility during an exponentially distributed time, it is deleted from the system. If the request finds all servers busy, it can make repeated attempts to enter the service. If all servers are busy, the request may depart from the system without service. In this case, with a fixed probability, the source that generated this request is deleted from the system. Sources arrive according to a Markov arrival process. If the number of sources in the system at the arrival epoch has the maximum allowed number, the arriving source is lost. This system is a more adequate model of many real-world systems than the standard finite source queue. Analysis of the considered system required a four-dimensional continuous-time Markov chain. The generator of the chain was obtained as a block matrix with four levels of nesting. The stationary distribution of this Markov chain was found numerically as well as the values of the system's performance measures. The dependence of these measures on the maximum allowed number of sources and the number of servers was numerically clarified. An example of solving an optimization problem was presented.
- finite-source queueing model,
- Markov arrival process,
- retrial,
- multidimensional Markov chains,
- performance,
- modeling
Citation: Ciro D'Apice, Alexander Dudin, Sergei Dudin, Rosanna Manzo. Analysis of a multi-server retrial queue with a varying finite number of sources[J]. AIMS Mathematics, 2024, 9(12): 33365-33385. doi: 10.3934/math.20241592

Related Papers:

Abstract

A multi-server retrial queue with a finite number of sources of requests was considered. In contrast to similar models studied in the literature, we assumed this number is not constant but changes its value in a finite range. During the stay in the system, each source generates the service requests. These requests are processed in a finite pool of servers. After service completion of a request, the source is granted the possibility to generate another request. If the source does not use this possibility during an exponentially distributed time, it is deleted from the system. If the request finds all servers busy, it can make repeated attempts to enter the service. If all servers are busy, the request may depart from the system without service. In this case, with a fixed probability, the source that generated this request is deleted from the system. Sources arrive according to a Markov arrival process. If the number of sources in the system at the arrival epoch has the maximum allowed number, the arriving source is lost. This system is a more adequate model of many real-world systems than the standard finite source queue. Analysis of the considered system required a four-dimensional continuous-time Markov chain. The generator of the chain was obtained as a block matrix with four levels of nesting. The stationary distribution of this Markov chain was found numerically as well as the values of the system's performance measures. The dependence of these measures on the maximum allowed number of sources and the number of servers was numerically clarified. An example of solving an optimization problem was presented.

References

[1]	G. I. Falin, J. G. C. Templeton, Retrial queues, London: Chapman & Hall, 1997.
[2]	J. R. Artalejo, A. Gomez-Corral, Retrial queueing systems, Berlin: Springer, 2008.
[3]	G. Falin, A survey of retrial queues, Queueing Syst., 7 (1990), 127–167. https://doi.org/10.1007/BF01158472 doi: 10.1007/BF01158472
[4]	T. Yang, J. G. C. Templeton, A survey on retrial queues, Queueing Syst., 2 (1987), 201–233. https://doi.org/10.1007/BF01158899 doi: 10.1007/BF01158899
[5]	A. Gomez-Corral, A bibliographical guide to the analysis of retrial queues through matrix analytic techniques, Ann. Oper. Res., 141 (2006), 163–191. https://doi.org/10.1007/s10479-006-5298-4 doi: 10.1007/s10479-006-5298-4
[6]	J. R. Artalejo, Accessible bibliography on retrial queues: progress in 2000–2009, Math. Comput. Model., 51 (2010), 1071–1081. https://doi.org/10.1016/j.mcm.2009.12.011 doi: 10.1016/j.mcm.2009.12.011
[7]	J. Kim, B. Kim, A survey of retrial queueing systems, Ann. Oper. Res., 247 (2016), 3–36. https://doi.org/10.1007/s10479-015-2038-7 doi: 10.1007/s10479-015-2038-7
[8]	C. S. Kim, S. H. Park, A. Dudin, V. Klimenok, G. Tsarenkov, Investigation of the $BMAP/G/1\to/\bullet/PH/1/M$ tandem queue with retrials and losses, Appl. Math. Model., 34 (2010), 2926–2940. https://doi.org/10.1016/j.apm.2010.01.003 doi: 10.1016/j.apm.2010.01.003
[9]	G. Falin, J. R. Artalejo, A finite source retrial queue, Eur. J. Oper. Res., 108 (1998), 409–424. https://doi.org/10.1016/S0377-2217(97)00170-7 doi: 10.1016/S0377-2217(97)00170-7
[10]	G. Falin, A multiserver retrial queue with a finite number of sources of primary calls, Math. Comput. Model., 30 (1999), 33–49. https://doi.org/10.1016/S0895-7177(99)00130-2 doi: 10.1016/S0895-7177(99)00130-2
[11]	Y. N. Kornyshev, Design of a fully accessible switching system with repeated calls, Telecommunications, 23 (1969), 46–52.
[12]	A. G. Kok, Algorithmic methods for single server systems with repeated attempts, Stat. Neerl., 38 (1984), 23–32. https://doi.org/10.1111/j.1467-9574.1984.tb01094.x doi: 10.1111/j.1467-9574.1984.tb01094.x
[13]	G. Bianchi, IEEE 802.11-saturation throughput analysis, IEEE Commun. Lett., 2 (1998), 318–320. http://dx.doi.org/10.1109/4234.736171 doi: 10.1109/4234.736171
[14]	Y. Lee, M. Y. Chung, T. J. Lee, Performance analysis of IEEE 802.11 DCF under nonsaturation condition, Lect. Notes Comput. Sci., 17 (2008), 1–17. http://doi.org/10.1155/2008/574197 doi: 10.1155/2008/574197
[15]	S. R. Chakravarthy, Introduction to matrix-analytic methods in queues 1: analytical and simulation approach-basics, In: ISTE Ltd, London and John Wiley and Sons, New York, 2022.
[16]	S. R. Chakravarthy, Introduction to matrix-analytic methods in queues 2: analytical and simulation approach-queues and simulation, In: ISTE Ltd, London and John Wiley and Sons, New York, 2022.
[17]	A. N. Dudin, V. I. Klimenok, V. M. Vishnevsky, The theory of queuing systems with correlated flows, Berlin: Springer Nature, 2020. https://doi.org/10.1007/978-3-030-32072-0
[18]	D. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Commun. Stat. Stochast. Models, 7 (1991), 1–46. https://doi.org/10.1080/15326349108807174 doi: 10.1080/15326349108807174
[19]	M. Gonzalez, R. E. Lillo, J. Ramirez Cobo, Call center data modeling: a queueing science approach based on Markovian arrival processes, Qual. Technol. Quant. Manage., 2024. http://dx.doi.org/10.1080/16843703.2024.2371715
[20]	S. A. Dudin, The $MAP/N/N$ retrial queueing system with time-phased batch arrivals, Probl. Inform. Transmiss., 45 (2009), 270–281. https://doi.org/10.1134/S0032946009030089 doi: 10.1134/S0032946009030089
[21]	J. Wu, Z. Liu, G. Yan, Analysis of the finite source $MAP/PH/N$ retrial $G$-queue operating in a random environment, Appl. Math. Model., 35 (2011), 1184–1193. https://doi.org/10.1016/j.apm.2010.08.006 doi: 10.1016/j.apm.2010.08.006
[22]	M. F. Neuts, Matrix-geometric solutions in stochastic models: an algorithmic approach, Chicago: Courier Corporation, 1994.
[23]	C. A. O'Cinneide, Phase-type distributions: open problems and a few properties, Stochast. Models, 15 (1999), 731–757. https://doi.org/10.1080/15326349908807560 doi: 10.1080/15326349908807560
[24]	P. Wüchner, J. Sztrik, H. de Meer, Finite-source $M/M/S$ retrial queue with search for balking and impatient customers from the orbit, Comput. Networks, 53 (2009), 1264–1273. https://doi.org/10.1016/j.comnet.2009.02.015 doi: 10.1016/j.comnet.2009.02.015
[25]	A. S. Alfa, K. S. Isotupa, An $M/PH/k$ retrial queue with finite number of sources, Comput. Oper. Res., 31 (2004), 1455–1464. https://doi.org/10.1016/S0305-0548(03)00100-X doi: 10.1016/S0305-0548(03)00100-X
[26]	Q. M. He, A. S. Alfa, Space reduction for a class of multidimensional Markov chains: a summary and some applications, INFORMS J. Comput., 30 (2018), 1–10. https://doi.org/10.1287/ijoc.2017.0759 doi: 10.1287/ijoc.2017.0759
[27]	D. Efrosinin, N. Stepanova, J. Sztrik, Algorithmic analysis of finite-source multi-server heterogeneous queueing systems, Mathematics, 9 (2021), 2624. https://doi.org/10.3390/math9202624 doi: 10.3390/math9202624
[28]	J. Roszik, J. Sztrik, Performance analysis of finite-source retrial queues with nonreliable heterogenous servers, J. Math. Sci., 146 (2007), 6033–6038.
[29]	Q. M. He, H. Li, Y. Q. Zhao, Ergodicity of the $BMAP/PH/s/s+ K$ retrial queue with PH-retrial time, Queueing Syst., 35 (2000), 323–347. https://doi.org/10.1023/A:1019110631467 doi: 10.1023/A:1019110631467
[30]	L. Breuer, A. Dudin, V. Klimenok, A retrial $BMAP/PH/N$ system, Queueing Syst., 40 (2002), 433–457. https://doi.org/10.1023/A:1015041602946 doi: 10.1023/A:1015041602946
[31]	L. Breuer, V. Klimenok, A. Birukov, A. Dudin, U. R. Krieger, Modeling the access to a wireless network at hot spots, Eur. Transact. Telecommun., 16 (2005), 309–316. https://doi.org/10.1002/ett.1000 doi: 10.1002/ett.1000
[32]	A. N. Dudin, R. Manzo, R. Piscopo, Single server retrial queue with group admission of customers, Comput. Oper. Res., 61 (2015), 89–99. https://doi.org/10.1016/j.cor.2015.03.008 doi: 10.1016/j.cor.2015.03.008
[33]	A. N. Dudin, S. A. Dudin, R. Manzo, L. Rarità, Analysis of multi-server priority queueing system with hysteresis strategy of server reservation and retrials, Mathematics, 10 (2022), 3747. https://doi.org/10.3390/math10203747 doi: 10.3390/math10203747
[34]	C. D'Apice, M. P. D'Arienzo, A. Dudin, R. Manzo, Admission control in priority queueing system with servers reservation and temporal blocking admission of low priority users, IEEE Access, 11 (2023), 44425–44443. https://doi.org/10.1109/ACCESS.2023.3273148 doi: 10.1109/ACCESS.2023.3273148
[35]	S. A. Dudin, O. S. Dudina, Call center operation model as a $MAP/PH/N/N-R$ system with impatient customers, Probl. Inform. Transmiss., 47 (2011), 364–377. https://doi.org/10.1134/S0032946011040053 doi: 10.1134/S0032946011040053
[36]	H. Baumann, W. Sandmann, Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers, Eur. J. Oper. Res., 256 (2017), 187–195. https://doi.org/10.1016/j.ejor.2016.07.035 doi: 10.1016/j.ejor.2016.07.035
[37]	A. N. Dudin, S. A. Dudin, R. Manzo, L. Rarità, Queueing system with batch arrival of heterogeneous orders, flexible limited processor sharing and dynamical change of priorities, AIMS Math., 9 (2024), 12144–12169. https://doi.org/10.3934/math.2024593 doi: 10.3934/math.2024593
[38]	A. Dudin, S. Dudin, A. Melikov, O. Dudina, Framework for analysis of queueing systems with correlated arrival processes and simultaneous service of a restricted number of customers in scenarios with an infinite buffer and retrials, Algorithms, 17 (2024), 493. https://doi.org/10.3390/a17110493 doi: 10.3390/a17110493
[39]	C. Kim, A. Dudin, O. Dudina, S. Dudin, Tandem queueing system with infinite and finite intermediate buffers and generalized phase-type service time distribution, Eur. J. Oper. Res., 235 (2014), 170–179. https://doi.org/10.1016/j.ejor.2013.12.012 doi: 10.1016/j.ejor.2013.12.012
[40]	A. Dudin, C. Kim, S. Dudin, O. Dudina, Priority retrial queueing model operating in random environment with varying number and reservation of servers, Appl. Math. Comput., 269 (2015), 674–690. https://doi.org/10.1016/j.amc.2015.08.005 doi: 10.1016/j.amc.2015.08.005
[41]	S. Dudin, A. Dudin, R. Manzo, L. Rarità, Analysis of semi-open queueing network with correlated arrival process and multi-server nodes, Oper. Res. Forum, 5 (2024), 99. https://doi.org/10.1007/s43069-024-00383-z doi: 10.1007/s43069-024-00383-z

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)