A finite-source M/G/1 retrial queue with outgoing calls
- 3 Downloads
In this paper we deal with a single-server, finite-source retrial queue where the server not only accepts incoming calls but after some exponentially distributed idle time makes outgoing calls. The service times of incoming and outgoing calls follow two distinct arbitrary distributions. The outgoing calls are directed not to the customers in the system but outside it, which implies that the model can be considered as a model with vacations or with customers of two types. Along with the standard retrial queue where all customers are allowed to join the orbit we consider also the corresponding queue with restriction on the orbit size. We derive formulas for computing the stationary system state distribution and investigate the influence of the system input parameters on the main macro characteristics of the system performance.
KeywordsFinite queues Retrials Outgoing calls Restriction on the orbit size
T. Phung-Duc was supported in part by JSPS KAKENHI Grant Number 18K18006.
- Amador, J. (2010). On the distribution of the successful and blocked events in retrial queues with finite number of sources. Proceedings of the 5th international conference on Queueing theory and network applications (pp. 15–22).Google Scholar
- Balazsfalvi, G., & Sztrik, J. (2008). A tool for modeling distributed protocols. PIK, 31(1), 39–44.Google Scholar
- Biro, J., Berchez, T., Korosi, A., Heszberger, Z., & Sztrik, J. (2013). Discriminatory processor sharing from optimization point of view. In ASMTA (pp. 67–80).Google Scholar
- Cooper, R. (1981). Introduction to queueing theory (2nd ed.). London: Edward Arnold.Google Scholar
- Dragieva, V., & Phung-Duc, T. (2016). Two-way communication M/M/1 retrial queue with server-orbit interaction. In Proceedings of the 11th international conference on Queueing theory and network applications, (ACM Digital Library). https://doi.org/10.1145/3016032.3016049.
- Dragieva, V., & Phung-Duc, T. (2017). Two-way communication M/M/1//N retrial queue. In Proceedings of 24th international conference on analytical & stochastic modelling techniques & applications (ASMTA 2017), LNCS 10378 (pp. 81–94).Google Scholar
- Falin, G. (1979). Model of coupled switching in presence of recurrent calls. Engineering Cybernetics Review, 17, 53–59.Google Scholar
- Jain, R. (1991). The art of computer systems performance analysis. New York: Wiley.Google Scholar
- Jaiswal, N. (1969). Priority queues. New York: Academic press.Google Scholar
- Kuki, A., Sztrik, J., Toth, A., Berches, T. (2018). A contribution to modeling two-way communication with retrial queueing systems. In A. Dudin, A. Nazarov, A. Moiseev (Eds.), Information technologies and mathematical modelling. Queueing Theory and applications, ITMM 2018, communications in computer and information science, (Vol. 912, pp. 236–247). https://doi.org/10.1007/978-3-319-97595-5_17.
- Nazarov, A., Sztrik, J., & Kvach, A. (2018). Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with two-way communication. In A. Dudin, A. Nazarov, & A. Moiseev (Eds.), Information technologies and mathematical modelling. Queueing theory and applications, ITMM 2018, communications in computer and information science (Vol. 912, pp. 172–183). https://doi.org/10.1007/978-3-319-97595-5_17.
- Nazarov, A., Sztrik, J., Kvach, A. (2017). Some features of a finite-source M/GI/1 retrial queueing system with collisions of customers. In Proceedings of 20th international conference, DCCN (pp. 186–200).Google Scholar