Abstract
We consider a single server retrial queueing system with parallel queues of ordinary and priority customers. Priority customers join the queues according to a probabilistic joining strategy until the ordinary queue is full. We also assume that there is a waiting room for the blocked ordinary customers and they make retrials from there, to enter into the ordinary queue. Priority customers on arrival, seeing both ordinary and priority queue as full loss the system forever. Customers receive service on the basis of a token system. Ordinary customers, upon arrival finding the ordinary queue as full, enter into the orbit. Ordinary customers make their retrials from the orbit in an exponential duration of time intervals to enter into the ordinary queue. Ordinary customer from the orbit make their retrials in an exponential duration of time intervals. Whenever the queue size of ordinary queue is less than N then the ordinary customer in the orbit successfully enter into the ordinary queue. Two types of customers arrive according to Marked Markovian Arrival Process (MMAP). Service times are assumed to follow phase type distributions. Steady-state analysis of the model is done. Some system characteristics are evaluated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Berlin (2008). https://doi.org/10.1007/978-3-540-78725-9
Artalejo, J.R.: Accessible bibliography of research on retrial queues. Math. Comput. Modell. 30(3–4), 1–6 (1999)
Chakravarthy, S., Thiagarajan, S.: Two parallel queues with simultaneous services and Markovian arrivals. J. Appl. Math. Stochast. Anal. 10(4), 383–405 (1997)
Choi, B.D., Chang, Y.: MAP1, MAP2/M/c retrial queue with the retrial group of finite capacity and geometric loss. Math. Comput. Modell. 30, 99–113 (1999)
Dudin, S., Kim, C., Dudina, O.: MMAP/M/N queueing system with impatient heterogeneous customers as a model of a contact center. Comput. Oper. Res. 40(7), 1790–1803 (2013)
Falin, G.I.: On a multiclass batch arrival retrial queue. Adv. Appl. Probab. 20, 483–487 (1988)
Krishnamoorthy, A., Deepak, T.G., Joshua, V.C.: Queues with postponed work. Top 12, 375–398 (2004). https://doi.org/10.1007/BF02578967
Krishnamoorthy, A., Manjunath, A.S.: On priority queues generated through customer induced service interruption. Neural Parallel Sci. Comput. 23, 459–486 (2015)
Krishnamoorthy, A., Manjunath, A.S.: On queues with priority determined by feedback. Calcutta Stat. Assoc. Bull. 70, 33–56 (2018)
Krishnamoorthy, A., Joshua, V.C., Babu, D.: A token based parallel processing queueing system with priority. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2017. CCIS, vol. 700, pp. 231–239. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66836-9_19
Kulkarni, V.G.: Expected waiting time in a multi-class batch arrival retrial queue. J. Appl. Probab. 23, 144–154 (1986)
Latouche, G., Ramaswami, V.: Introduction to Matrix analytic Methods in Stochastic Modelling. Siam (1999)
Mathew, A.P., Krishnamoorthy, A., Joshua, V.C.: A retrial queueing system with orbital search of customers lost from an offer zone. In: Dudin, A., Nazarov, A., Moiseev, A. (eds.) ITMM/WRQ -2018. CCIS, vol. 912, pp. 39–54. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97595-5_4
Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981)
Takagi H.: Queueing Analysis. Volume 1: Vacations and Priority Systems. North-Holland, Amsterdam (1991)
Wang, J., Zhang, F.: Strategic joining in M/M/1 retrial queues. Eur. J. Oper. Res. 230(1), 76–87 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Babu, D., Joshua, V.C., Krishnamoorthy, A. (2020). Token Based Parallel Processing Retrial Queueing System with a Probabilistic Joining Strategy for Priority Customers. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2020. Communications in Computer and Information Science, vol 1337. Springer, Cham. https://doi.org/10.1007/978-3-030-66242-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-66242-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66241-7
Online ISBN: 978-3-030-66242-4
eBook Packages: Computer ScienceComputer Science (R0)