Liu, Bin; Zhao, Yiqiang Q. Tail asymptotics for the \(M_1,M_2/G_1,G_2/1\) retrial queue with non-preemptive priority. (English) Zbl 1461.60081 Queueing Syst. 96, No. 1-2, 169-199 (2020). Summary: Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: retrial queueing systems with priority. This type of queueing system is important in various applications, including telecommunication and computer management networks with big data. The system considered here receives two types of customers, of which Type-1 customers (in a queue) have non-pre-emptive priority to receive service over Type-2 customers (in an orbit). For this type of system, we propose an exhaustive version of the stochastic decomposition approach, which is one of the main contributions made in this paper, for the purpose of studying asymptotic behaviour of the tail probability of the number of customers in the steady state for this retrial queue with two types of customers. Under the assumption that the service times of Type-1 customers have a regularly varying tail and the service times of Type-2 customers have a tail lighter than Type-1 customers, we obtain tail asymptotic properties for the numbers of customers in the queue and in the orbit, respectively, conditioning on the server’s status, in terms of the exhaustive stochastic decomposition results. These tail asymptotic results are new, which is another main contribution made in this paper. Tail asymptotic properties are very important, not only on their own merits but also often as key tools for approximating performance metrics and constructing numerical algorithms. Cited in 3 Documents MSC: 60K25 Queueing theory (aspects of probability theory) 60G50 Sums of independent random variables; random walks 90B22 Queues and service in operations research Keywords:exhaustive stochastic decomposition approach; tail asymptotics; retrial queue; priority queue; number of customers; stationary distribution; regularly varying distribution PDFBibTeX XMLCite \textit{B. Liu} and \textit{Y. Q. Zhao}, Queueing Syst. 96, No. 1--2, 169--199 (2020; Zbl 1461.60081) Full Text: DOI arXiv References: [1] Artalejo, JR; Dudin, AN; Klimenok, VI, Stationary analysis of a retrial queue with preemptive repeated attempts, Oper. Res. Lett., 28, 173-180 (2001) · Zbl 0992.90010 [2] Artalejo, JR; Gómez-Corral, A., Retrial Queueing Systems (2008), Berlin: Springer, Berlin · Zbl 1161.60033 [3] Asmussen, S.; Klüppelberg, C.; Sigman, K., Sampling at subexponential times, with queueing applications, Stoch. Process. Their Appl., 79, 2, 265-286 (1999) · Zbl 0961.60080 [4] Bingham, NH; Goldie, CM; Teugels, JL, Regular Variation (1989), Cambridge: Cambridge University Press, Cambridge [5] Borst, SC; Boxma, OJ; Nunez-Queija, R.; Zwart, AP, The impact of the service discipline on delay asymptotics, Perform. Eval., 54, 175-206 (2003) [6] Boxma, O.; Denisov, D., Sojourn time tails in the single server queue with heavy-tailed service times, Queue. Syst., 69, 101-119 (2011) · Zbl 1238.60101 [7] Boxma, O.; Zwart, B., Tails in scheduling, ACM Sigmetrics Perform. Eval. Rev., 34, 13-20 (2007) [8] Choi, BD; Chang, Y., Single server retrial queues with priority calls, Math. Comput. Model., 30, 7-32 (1999) · Zbl 1042.60533 [9] Dimitriou, I., A mixed priority retrial queue with negative arrivals, unreliable server and multiple vacations, Appl. Math. Model., 37, 1295-1309 (2013) · Zbl 1351.90075 [10] de Meyer, A.; Teugels, JL, On the asymptotic behavior of the distributions of the busy period and service time in \(M/G/1\), J. Appl. Probab., 17, 802-813 (1980) · Zbl 0444.60088 [11] Dudin, AN; Lee, MH; Dudina, O.; Lee, SK, Analysis of priority retrial queue with many types of customers and servers reservation as a model of cognitive radio system, IEEE Trans. Commun., 65, 1, 186-199 (2017) [12] Embrechts, P.; Kluppelberg, C.; Mikosch, T., Modelling Extremal Events for Insurance and Finance (1997), Heidelberg: Springer, Heidelberg · Zbl 0873.62116 [13] Falin, GI, A survey of retrial queues, Queue. Syst., 7, 2, 127-168 (1990) · Zbl 0709.60097 [14] Falin, GI; Artalejo, JR; Martin, M., On the single server retrial queue with priority customers, Queue. Syst., 14, 3-4, 439-455 (1993) · Zbl 0790.60076 [15] Feller, W., An Introduction to Probability Theory and Its Applications (1971), London: Wiley, London · Zbl 0219.60003 [16] Foss, S.; Korshunov, D., Sampling at a random time with a heavy-tailed distribution, Markov Process. Relat. Fields, 6, 4, 543-568 (2000) · Zbl 0977.60091 [17] Foss, S.; Korshunov, D.; Zachary, S., An Introduction to Heavy-Tailed and Subexponential Distributions (2011), New York: Springer, New York · Zbl 1250.62025 [18] Gao, S., A preemptive priority retrial queue with two classes of customers and general retrial times, Oper. Res. Int. J., 15, 233-251 (2015) [19] Gómez-Corral, A., Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority, Comput. Math. Appl., 43, 767-782 (2002) · Zbl 1009.60083 [20] Grandell, J., Mixed Poisson Processes (1997), London: Chapman & Hall, London · Zbl 0922.60005 [21] Kim, J.; Kim, B., A survey of retrial queueing systems, Ann. Oper. Res., 247, 1, 3-36 (2016) · Zbl 1357.60100 [22] Kim, J.; Kim, J.; Kim, B., Regularly varying tail of the waiting time distribution in \(M/G/1\) retrial queue, Queue. Syst., 65, 4, 365-383 (2010) · Zbl 1230.90063 [23] Kim, J.; Kim, B.; Ko, S-S, Tail asymptotics for the queue size distribution in an \(M/G/1\) retrial queue, J. Appl. Probab., 44, 4, 1111-1118 (2007) · Zbl 1133.60361 [24] Lee, Y., Discrete-time \(Geo^X/G/1\) queue with preemptive resume priority, Math. Comput. Model., 34, 243-250 (2001) · Zbl 0989.60096 [25] Liu, B., Min, J., Zhao, Y.Q.: Refined tail asymptotic properties for the \(M^X/G/1\) retrial queue. Submitted. (arXiv:1801.02525) (2017) [26] Liu, B.; Zhao, YQ, Analyzing retrial queues by censoring, Queue. Syst., 64, 3, 203-225 (2010) · Zbl 1186.60097 [27] Liu, B., Zhao, Y.Q.: Second order asymptotic properties for the tail probability of the number of customers in the \(M/G/1\) retrial queue. Submitted. (arXiv:1801.09607) (2017) [28] Liu, B., Zhao, Y.Q.: Tail Asymptotics for a Retrial Queue with Bernoulli Schedule. Submitted. (arXiv:1804.00984) (2018) [29] Liu, B.; Wang, J.; Zhao, YQ, Tail asymptotics of the waiting time and the busy period for the \(M/G/1/K\) queues with subexponential service times, Queue. Syst., 76, 1, 1-19 (2014) · Zbl 1307.60132 [30] Liu, B.; Wang, X.; Zhao, YQ, Tail asymptotics for \(M/M/c\) retrial queues with nonpersistent customers, Oper. Res. Int. J., 12, 2, 173-188 (2012) · Zbl 1256.90019 [31] Müller, A.; Stoyan, D., Comparison Methods for Stochastic Models and Risks (2002), London: Wiley, London · Zbl 0999.60002 [32] Phung-Duc, T.: Retrial Queueing Models: A survey on theory and applications, to appear In: Dohi T., Ano, K., Kasahara, S. (eds.) Stochastic Operations Research in Business and Industry, World Scientific Publisher. (http://infoshako.sk.tsukuba.ac.jp/tuan/papers/Tuan_chapter_ver3.pdf) (2017) [33] Sutton, C.; Jordan, MI, Bayesian inference for queueing networks and modeling of internet services, Ann. Appl. Stat., 5, 1, 254-282 (2011) · Zbl 1220.62024 [34] Walraevens, J.; Claeys, D.; Phung-Duc, T., Asymptotics of queue length distributions in priority retrial queues, Perform. Eval., 127-128, 235-252 (2018) [35] Wang, J., On the single server retrial queue with priority subscribers and server break-downs, J. Syst. Sci. Complex, 21, 304-315 (2008) · Zbl 1256.90021 [36] Wu, J.; Lian, Z., A single-server retrial G-queue with priority and unreliable server under Bernoulli vacation schedule, Comput. Ind. Eng., 64, 84-93 (2013) [37] Wu, J.; Wang, J.; Liu, Z., A discrete-time Geo/G/1 retrial queue with preferred and impatient customers, Appl. Math. Model., 37, 2552-2561 (2013) · Zbl 1349.90238 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.