Research ArticleNo Access

Stochastic monotonicity approach for a non-Markovian priority retrial queue

Mohamed Boualem

https://orcid.org/0000-0001-9414-714X

Research Unit LaMOS (Modeling and Optimization of Systems), University of Bejaia, 06000 Bejaia, Algeria

E-mail Address: robertt15dz@yahoo.fr

Corresponding author.

Search for more papers by this author

and

Nassim Touche

Research Unit LaMOS (Modeling and Optimization of Systems), University of Bejaia, 06000 Bejaia, Algeria

E-mail Address: na_touche@yahoo.fr

Search for more papers by this author

https://doi.org/10.1142/S1793557121501564Cited by:3 (Source: Crossref)

Abstract

This paper considers a non-Markovian priority retrial queue which serves two types of customers. Customers in the regular queue have priority over the customers in the orbit. This means that the customer in orbit can only start retrying when the regular queue becomes empty. If another customer arrives during a retrial time, this customer is served and the retrial has to start over when the regular queue becomes empty again. In this study, a particular interest is devoted to the stochastic monotonicity approach based on the general theory of stochastic orders. Particularly, we derive insensitive bounds for the stationary joint distribution of the embedded Markov chain of the considered system.

Communicated by B. K. Dass

Keywords:

AMSC: 60K25, 90B22

References

1. L. M. Alem, M. Boualem and D. Aïssani, Stochastic comparison bounds for an $M_{1}, M_{2} / G_{1}, G_{2} / 1$ $M_{1}, M_{2} / G_{1}, G_{2} / 1$ retrial queue with two way communication, Hacettepe J. Math. Statistic. 48(4) (2019) 1185–1200. Web of Science, Google Scholar
2. L. M. Alem, M. Boualem and D. Aïssani, Bounds of the stationary distribution in $M / G / 1$ $M / G / 1$ retrial queue with two-way communication and $n$ $n$ types of outgoing calls, Yugoslav J. Op. Res. 29(3) (2019) 375–391. Crossref, Google Scholar
3. J. R. Artalejo and A. Gómez-Corral, Retrial Queueing System: A Computational Approach (Springer Edition, Berlin, 2008). Crossref, Google Scholar
4. M. Boualem, Insensitive bounds for the stationary distribution of a single server retrial queue with server subject to active breakdowns, Adv. Op. Res. 2014, (2014) Article ID 985453, 12 p. Google Scholar
5. M. Boualem, A. Bareche and M. Cherfaoui, Approximate controllability of stochastic bounds of stationary distribution of an M/G/1 queue with repeated attempts and two-phase service, Int. J. Management Sci. Eng. Management 14(2) (2019) 79–85. Web of Science, Google Scholar
6. M. Boualem, M. Cherfaoui and D. Aïssani, Monotonicity properties for a single server queue with classical retrial policy and service interruptions, Proc. Jangjeon Math. Soc. 19 (2016) 225–236. Google Scholar
7. M. Boualem, M. Cherfaoui, N. Djellab and D. Aïssani, A stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule, Bull. Iran. Math. Soc. 43 (2017) 1377–1397. Web of Science, Google Scholar
8. M. Boualem, M. Cherfaoui, N. Djellab and D. Aïssani, Inégalités stochastiques pour le modèle d’attente M/G/1/1 avec rappels, Afrika Matematika 28(5–6) (2017) 851–868. Crossref, Web of Science, Google Scholar
9. M. Boualem, N. Djellab and D. Aïssani, Stochastic inequalities for $M / G / 1$ $M / G / 1$ retrial queues with vacations and constant retrial policy, Math. Comput. Mod. 50 (2009) 207–212. Crossref, Web of Science, Google Scholar
10. M. Boualem, N. Djellab and D. Aïssani, Stochastic approximations and monotonicity of a single server feedback retrial queue, Math. Problem. Eng. 2012 (2012) Article ID 536982, 13 p. Crossref, Web of Science, Google Scholar
11. M. Boualem, N. Djellab and D. Aïssani, Stochastic bounds for a single server queue with general retrial times, Bull. Iran. Math. Soc. 40 (2014) 183–198. Web of Science, Google Scholar
12. A. Bušić and J. M. Fourneau, Monotonicity and performance evaluation: Applications to high speed and mobile networks, Cluster Comput. 15 (2012) 401–414. Crossref, Web of Science, Google Scholar
13. H. Castel-Taleb and N. Pekergin, Stochastic monotonicity in queueing networks, in Computer Performance Engineering, Lecture Notes in Computer Science, Vol. 5652 (Springer, Berlin, Heidelberg, 2009), pp. 116–130, https://doi.org/10.1007/978-3-642-02924-0_10. Crossref, Google Scholar
14. P. Chen, Y. Zhou and C. Li, Batch arrival retrial G-queue with orbital search and non-persistent customers, J. Interdiscipl. Math. 19 (2016) 95–109. Crossref, Web of Science, Google Scholar
15. B. D. Choi and Y. Chang, Single server retrial queues with priority calls, Math. Comput. Mod. 30 (1999) 7–32. Crossref, Web of Science, Google Scholar
16. G. I. Falin, J. R. Artalejo and M. Martin, On the single server retrial queue with priority customers, Queue. Syst. 14 (1993) 439–455. Crossref, Google Scholar
17. H. M. Liang, Service station factors in monotonicity of retrial queues, Math. Comput. Mod. 30 (1999) 189–196. Crossref, Web of Science, Google Scholar
18. W. A. Massey, Stochastic orderings for Markov processes on partially ordered spaces, Math. Oper. Res. 12 (1987) 350–367. Crossref, Web of Science, Google Scholar
19. A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks (John Wiley and Sons, 2002). Google Scholar
20. Z. Khalil and G. Falin, Stochastic inequalities for M/G/1 retrial queues, Op. Res. Lett. 16 (1994) 285–290. Crossref, Web of Science, Google Scholar
21. M. Shaked and J. G. Shanthikumar, Stochastic Orders (Springer-Verlag, New York, 2007). Crossref, Google Scholar
22. M. Shaked and J. G. Shanthikumar, Stochastic Orders and their Applications (Academic Press, San Diego, 1994). Google Scholar
23. D. Stoyan, Comparison Methods for Queues and other Stochastic Models (Wiley, New York, 1983). Google Scholar
24. R. Szekli, Stochastic Ordering and Dependence in Applied Probability (Springer, New York, 1995). Crossref, Google Scholar
25. I. M. Verloop, U. Ayesta and S. Borst, Monotonicity properties for multi-class queueing systems, Discrete Event Dyn. Syst. 20 (2010) 473–509. Crossref, Web of Science, Google Scholar
26. T. Yang and J. G. C. Templeton, A survey on retrial queues, Queue. Syst. 2 (1997) 201–233. Crossref, Google Scholar
27. D. Zirem, M. Boualem, K. Adel-Aissanou and D. Aïssani, Analysis of a single server batch arrival unreliable queue with balking and general retrial time, Quality Technol. Quantitative Management 16 (2019) 672–695. Crossref, Web of Science, Google Scholar