The Phenomenon of Secondary Flow Explosion in Retrial Priority Queueing System with Randomized Push-Out Mechanism

被引:2
作者
Korenevskaya, Maria [1 ]
Zayats, Oleg [1 ]
Ilyashenko, Alexander [1 ]
Muliukha, Vladimir [1 ]
机构
[1] Peter Great St Petersburg Polytech Univ, St Petersburg, Russia
来源
INTERNET OF THINGS, SMART SPACES, AND NEXT GENERATION NETWORKS AND SYSTEMS, NEW2AN 2018 | 2018年 / 11118卷
关键词
Priority queueing system; Retrial queueing system; Randomized push-out mechanism; Poisson arrivals; Exponential service time; Markov process; Steady-state distribution; Finite buffer; Preemptive priority; Non-preemptive priority; Explosion;
D O I
10.1007/978-3-030-01168-0_22
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:236 / 246
页数:11
相关论文
共 13 条
[1]  
Arnold V.I., 2004, Catastrophe Theory
[2]  
Avrachenkov K.E., 2004, J MATH SCI, V122, P3336, DOI [10.1023/b:joth.0000031879.84592.31, DOI 10.1023/B:JOTH.0000031879.84592.31]
[3]   Priority queueing with finite buffer size and randomized push-out mechanism [J].
Avrachenkov, KE ;
Vilchevsky, NO ;
Shevlyakov, GL .
PERFORMANCE EVALUATION, 2005, 61 (01) :1-16
[4]  
Basharin GP, 1969, QUEUEING MODELS DATA, P39
[5]  
Ilyashenko Alexander, 2017, Internet of Things, Smart Spaces and Next-Generation Networks and Systems. 17th International Conference NEW2AN 2017, 10th Conference ruSMART 2017 and Third Workshop NsCC 2017. Proceedings: LNCS 10531, P432, DOI 10.1007/978-3-319-67380-6_39
[6]  
Ilyashenko Alexander, 2014, Internet of Things, Smart Spaces, and Next Generation Networks and Systems. 14th International Conference, NEW2AN 2014 and 7th Conference, ruSMART 2014. Proceedings: LNCS 8638, P433, DOI 10.1007/978-3-319-10353-2_38
[7]   Randomized Priorities in Queuing System with Randomized Push-Out Mechanism [J].
Ilyashenko, Alexander ;
Zayats, Oleg ;
Muliukha, Vladimir .
INTERNET OF THINGS, SMART SPACES, AND NEXT GENERATION NETWORKS AND SYSTEMS, NEW2AN 2016/USMART 2016, 2016, 9870 :230-237
[8]   Alternating Priorities Queueing System with Randomized Push-Out Mechanism [J].
Ilyashenko, Alexander ;
Zayats, Oleg ;
Muliukha, Vladimir ;
Lukashin, Alexey .
INTERNET OF THINGS, SMART SPACES, AND NEXT GENERATION NETWORKS AND SYSTEMS, 2015, 9247 :436-445
[9]  
Jaiswal N.K., 1968, PRIORITY QUEUES
[10]   Preemptive queueing system with randomized push-out mechanism [J].
Muliukha, Vladimir ;
Ilyashenko, Alexander ;
Zayats, Oleg ;
Zaborovsky, Vladimir .
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2015, 21 (1-3) :147-158