Abstract
A single-server finite-buffer retrial system with a Poisson stream of arrivals and an exponential service time distribution is analyzed. If an arriving customer finds the buffer filled up, this customer joins a special retrial waiting group (orbit) in order to seek service again in an exponentially distributed period of time. The customers seeking service for the first time have the preemptive priority over retrial ones, thus, one can think of the original system as of the priority one with retrial customers being low-priority. We also introduce a randomized push-out buffer management mechanism, which makes it possible to control the loss probability of the high-priority and low-priority customers efficiently.
It is shown that such queueing model can be reduced to a similar one but without retrial. Using the generating function technique, main probabilistic characteristics (e.g., loss probabilities) for both types of the customers are obtained. The dependency of the loss probabilities on the model parameters, i.e., the push-out and retrial probabilities, is investigated. Regions of the load parameters are found such that the system is locked for the low-priority customers, or such that there is a linear dependence of the loss probabilities on the push-out probability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vishnevsky, V.M.: Theoretical Bases if Designing Computer Networks, 512 p. Technosphere, Moscow (2003)
Muliukha, V., Ilyashenko, A., Laboshin, L.: Network-centric supervisory control system for mobile robotic groups. Procedia Comput. Sci. 103, 505–510 (2017)
Zaborovsky, V., Guk, M., Muliukha, V., Ilyashenko, A.: Cyber-physical approach to the network-centric robot control problems. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN 2014. LNCS, vol. 8638, pp. 619–629. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10353-2_57
Zaborovsky, V., Muliukha, V., Ilyashenko, A.: Cyber-physical approach in a series of space experiments “kontur”. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) ruSMART 2015. LNCS, vol. 9247, pp. 745–758. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23126-6_69
Basharin, G.P.: Some results for priority systems, queueing theory in data transfer systems, pp. 39–53 (1969)
Avrachenkov, K.E., Shevlyakov, G.L., Vilchevsky, N.O.: Randomized push-out disciplines in priority queueing. J. Math. Sci. 22(4), 3336–3342 (2004)
Avrachenkov, K.E., Vilchevsky, N.O., Shevlyakov, G.L.: Priority queueing with finite buffer size and randomized push-out mechanism. Perform. Eval. 61(1), 1–16 (2005)
Ilyashenko, A., Zayats, O., Muliukha, V., Laboshin, L.: Further investigations of the priority queueing system with preemptive priority and randomized push–out mechanism. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN 2014. LNCS, vol. 8636, pp. 433–443. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10353-2_38
Muliukha, V., Ilyashenko, A., Zayats, O., Zaborovsky, V.: Preemptive queueing system with randomized push-out mechanism. Commun. Nonlinear Sci. Numer. Simul. 1(3), 147–158 (2015)
Ilyashenko, A., Zayats, O., Muliukha, V., Lukashin, A.: Alternating priorities queueing system with randomized push-out mechanism. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) ruSMART 2015. LNCS, vol. 9247, pp. 436–445. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23126-6_38
Ilyashenko, A., Zayats, O., Muliukha, V., Lukashin, A.: Randomized priorities in queuing system with randomized push-out mechanism. In: Galinina, O., Balandin, S., Koucheryavy, Y. (eds.) ruSMART 2016. LNCS, vol. 9870, pp. 230–237. Springer, Heidelberg (2016). doi:10.1007/978-3-319-46301-8_19
Falin, G.I., Templeton, J.G.: Retrial Queues, 328 p. Chapman and Hall, Boca Raton (1997)
Falin, G.I.: A survey of retrial queue. Queueing Syst. 7, 127–168 (1990)
Zayats, O., Korenevskaya, M., Ilyashenko, A., Lukashin, A.: Retrial queueing systems in series of space experiments “kontur”. Procedia Comput. Sci. 103, 562–568 (2017)
Bocharov, P.P., Pavlova, O.I., Puzikova, D.A.: A M/G/1/r retrial queueing system with priority of primary customers. Math. Comput. Model. 30(1), 89–98 (1999)
Bocharov, P.P., Pechinkin, A.V., Fong, N.: Stationary probabilities of the states of the retrial system MAP/G/1/r with priority servicing of primary customers. Autom. Remote Control 8(61), 68–78 (2000)
Agalarov, Y.M.: On a numerical method for calculating stationary characteristics of the switching node with retrial transmissions. Autom. Remote Control 1, 95–106 (2011)
Acknowledgement
This work was financially supported by the Ministry of Education and Science of the Russian Federation in the framework of the Federal Targeted Programme for Research and Development in Priority Areas of Advancement of the Russian Scientific and Technological Complex for 2014–2020 (No. 14.578.21.0211, ID RFMEFI57816X0211).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ilyashenko, A., Zayats, O., Korenevskaya, M., Muliukha, V. (2017). A Retrial Queueing System with Preemptive Priority and Randomized Push-Out Mechanism. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networks and Systems. ruSMART NsCC NEW2AN 2017 2017 2017. Lecture Notes in Computer Science(), vol 10531. Springer, Cham. https://doi.org/10.1007/978-3-319-67380-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-67380-6_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67379-0
Online ISBN: 978-3-319-67380-6
eBook Packages: Computer ScienceComputer Science (R0)