Abstract
We consider a single-server queueing system with finite buffer size, Poisson arrivals and exponentially distributed service time. If the arriving customer finds the completely filled queue of the system, the customer joins a special retrial waiting group (called the orbit) and after a random period of time that has an exponential distribution tries to come to the system again. Primary customers take priority over secondary customers. We also introduce the so-called randomized push-out buffer management mechanism. It allows primary customers to push secondary ones out of the system to free up space. Such a queueing system can be reduced to a similar model without retrials, which had been studied by the authors earlier. Using generating functions approach, we obtain loss probabilities for both types of customers. Theoretical results allow to investigate the dependence of the loss probabilities on the main parameters of the model (such as the push-out and retrial probabilities). We considered in details the cases of preemptive and non-preemptive priorities and discovered an interesting phenomenon. When the intensity of the primary flow increases smoothly after it reaches a certain critical value, an avalanche-like increase in the intensity of the secondary flow occurs (up to tens of thousands of times). In other words, there is a kind of “explosion” of the flow of secondary customers. This article is a strictly quantitative study of this phenomenon, which is of great interest in the calculation of telematic devices.
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. Technosphere, Moscow (2003)
Tanenbaum, A.S., Wetherall, D.J.: Network computers. Prentice Hall, Boston (2011)
Jaiswal, N.K.: Priority queues. Academic Press, New York (1968)
Basharin, G.P.: Some Results for Priority Systems. Queueing Theory in Data Transfer Analysis, pp. 39–53. Nauka, Moscow (1969). (in Russian)
Avrachenkov, K.E., Shevlyakov, G.L., Vilchevsky, N.O.: Randomized push-out disciplines in priority queueing. J. Math. Sci. 22(4), 3336–3343 (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 queuing system with preemptive priority and randomized push-out mechanism. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN 2014. LNCS, vol. 8638, pp. 433–443. Springer, Cham (2014). https://doi.org/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. 21(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, Cham (2015). https://doi.org/10.1007/978-3-319-23126-6_38
Ilyashenko, A., Zayats, O., Muliukha, V.: Randomized priorities in queuing system with randomized push-out mechanism. In: Galinina, O., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN/ruSMART -2016. LNCS, vol. 9870, pp. 230–237. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46301-8_19
Zayats, O., Korenevskaya, M., Ilyashenko, A., Lukashin, A.: Retrial queueing systems in series of space experiments “Kontur”. Procedia Comput. Sci. 103, 562–568 (2017)
Ilyashenko, A., Zayats, O., Korenevskaya, M., Muliukha, V.: a retrial queueing system with Preemptive priority and randomized push-out mechanism. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN/ruSMART/NsCC -2017. LNCS, vol. 10531, pp. 432–440. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67380-6_39
Arnold, V.I.: Catastrophe Theory. Springer, Berlin (2004)
Acknowledgement
This research was supported by RFBR grant № 18-29-03250 mk.
Also this work related to the high performance computations and modelling was done using the infrastructure of the Shared-Use Center “Supercomputer Center Polytechnic” at Peter the Great St.Petersburg Polytechnic university registered at http://ckp-rf.ru/ckp/500675/ (shared-use center id 500676).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Korenevskaya, M., Zayats, O., Ilyashenko, A., Muliukha, V. (2018). The Phenomenon of Secondary Flow Explosion in Retrial Priority Queueing System with 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. NEW2AN ruSMART 2018 2018. Lecture Notes in Computer Science(), vol 11118. Springer, Cham. https://doi.org/10.1007/978-3-030-01168-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-01168-0_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01167-3
Online ISBN: 978-3-030-01168-0
eBook Packages: Computer ScienceComputer Science (R0)