Abstract
In this paper, we consider a continuous-time retrial queue with two classes of customers: priority customers and ordinary customers, where priority customers don’t queue and have an exclusive preemptive priority to receive their services over ordinary customers. If an arriving ordinary customer finds the server busy, it enters a retrial group (called orbit) according to FCFS discipline. Only the ordinary customer at the head of the retrial queue is allowed to access the server. Firstly, we obtain the necessary and sufficient condition for the system to be stable by embedded Markov chain approach. Secondly, using supplementary variable method, we obtain the stationary probability distribution and some performance measures of interest. Thirdly, we give the analysis of the sojourn time in the system of an arbitrary ordinary customer. Lastly, numerical examples are given to show the effect of system parameters on several performance measures.
Similar content being viewed by others
References
Akyildiz IF, Lee WY, Vuran MC, Mohanty S (2006) Next generation/dynamic spectrum access/cognitive radio wireless networks: a survey. Comput Netw 50:2127–2159
Artalejo JR (1999) A classified bibliography of research on retrial queues: progress in 1990–1999. Top 7:187–211
Artalejo JR (2010) Accessible bibliography on retrial queues: progress in 2000–2009. Math Comput Model 51:1071–1081
Artalejo JR, Gómez-Corral A (2008) Retrial queueing systems: a computational approach. Springer, Berlin
Choi BD, Park KK (1990) The M/G/1 retrial queue with Bernoulli schedule. Queueing Syst 7(2):219–228
Dimitriou I (2013a) A mixed priority retrial queue with negative arrivals, unreliable server and multiple vacations. Appl Math Model 37:1295–1309
Dimitriou I (2013b) A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers. TOP 21:542–571
Falin GI, Artalejo JR, Martin M (1993) On the single retrial queue with priority customers. Queueing Syst 14(3–4):439–455
Falin GI, Templeton JGC (1997) Retrial queues. Chapman & Hall, London
Gao S, Wang JT (2014) Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers. Eur J Oper Res 236:561–572
Gómez-Corral A (2006) A bibliographical guide to analysis of retrial queues through matrix analytic techniques. Ann Oper Res 141:163–191
Gómez-Corral A (1999) Stochastic analysis of a single server retrial queue with general retrial time. Naval Res Logist 46:561–581
Krishna Kumar B, Vijayakumar A, Arivudainambi D (2002) An M/G/1 retrial queueing system with two-phase service and preemptive resume. Ann Oper Res 113:61–79
Krishna Kumar B, Pavai Madheswari S (2004) Mixed loss and delay retrial queueing system with two classes of customers. Statistica LXIV(1):57–73
Langaris C, Moutzoukis E (1995) A retrial queue with structured batch arrivals, priorities and server vacations. Queueing Syst 20:341–368
Liu ZM, Gao S (2011) Discrete-time \({\text{ Geo }}_1, {\text{ Geo }}_2^X /{\text{ G }}_1, {\text{ G }}_2/1\) retrial queue with two classes of customers and feedback. Math Comput Model 53:1208–1220
Pakes AG (1969) Some conditions for ergodicity and recurrence of Markov chains. Oper Res 17(6):1058–1061
Wang JT (2006) Reliability analysis of M/G/1 queues with general retrial times and server breakdowns. Prog Nat Sci 16(5):464–473
Wang JT (2008) On the single server retrial queue with priority subscribers and server break-downs. J Syst Sci Complex 21:304–315
Wu JB, Wang JX, Liu ZM (2013) A discrete-time Geo/G/1 retrial queue with preferred and impatient customers. Appl Math Model 37:2552–2561
Yucek T, Arslan H (2009) A survey of spectrum sensing algorithms for cognitive radio applications. Commun Surv Tutor 11:116–130
Acknowledgments
The authors would like to thank the anonymous referees for their helpful comments and suggestions, which improved the content and the presentation of this paper. This work is supported by the National Natural Science Foundation of China (Nos. 11171179, 11301306), the Natural Science Foundation of Anhui Higher Education Institutions of China (No. KJ2014ZD21), the National Statistical Science Research Project of China (No. 2014191) and Program for Science Research of Fuyang Normal College (No. 2014LY088).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gao, S. A preemptive priority retrial queue with two classes of customers and general retrial times. Oper Res Int J 15, 233–251 (2015). https://doi.org/10.1007/s12351-015-0175-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-015-0175-z