Abstract
We consider a single-line queuing system with an infinite buffer that receives two Poisson flows of customers with different intensities. Customers of the first type have preemptive priority over customers of the second type. In addition, at the time of the end of servicing, a high-priority customer with some probability can drop all low-priority customers in the queue. Serving both types of customers has an exponential distribution with different parameters. We show expressions for calculating stationary probabilities in this system, the probability of servicing a low-priority customer in terms of the generating function, and a formula for the average number of customers of the second type.
Similar content being viewed by others
Notes
At the same time, logical errors were made in (4) and (17).
References
Gelenbe, E., Glynn, P. & Sigman, K. Queues with Negative Arrivals 28(no. 1), 245–250 (1991).
Do, T. V. Bibliography on G-Networks, Negative Customers and Applications. Math. Comput. Model. 53, 205–212 (2011).
Caglayan, M. G-Networks and Their Applications to Machine Learning, Energy Packet Networks and Routing: Introduction to the Special Issue. Prob. Eng. Inform. Sci. 31(no. 4), 381–395 (2017).
Malinkovskii, Yu.V. and Borodin, N.N.Queueing Networks with Finite Number of Flows of Negative Customers and with Limited Sojourn Time, Probl. Fiz., Mat. Tekh., 2017, no. 1, pp. 64–68.
Malinkovskii, Yu. V. Stationary Probability Distribution for States of G-Networks with Constrained Sojourn Time. Autom. Remote Control 78(no. 10), 1857–1866 (2017).
Dimitriou, I. A Mixed Priority Retrial Queue with Negative Arrivals, Unreliable Server and Multiple Vacations. Appl. Math. Model. 37, 1295–1309 (2013).
Rajkumar, M. An (s, S) Retrial Inventory System with Impatient and Negative Customers. Int. J. Math. Oper. Res. 6, 106–122 (2014).
Farkhadov, M. and Fedorova, E.Asymptotic Analysis of Retrial Queue M∣M∣1 with Negative Calls Under Heavy Load Condition, in Proc. 20th Int. Conf. "Distributed Computer and Communication Networks: Control, Computation, Communications” (DCCN-2017), Moscow: TEKHNOSFERA, 2017, pp. 470–475.
Farkhadov, M. & Fedorova, E. Retrial Queue M∣M∣1 with Negative Calls Under Heavy Load Condition. Commun. Comput. Inform. Sci. 700, 406–416 (2017).
Zidani, N., Spiteri, P. & Djellab, N. Numerical Solution for the Performance Characteristics of the M∣M∣C∣K Retrial Queue with Negative Customers and Exponential Abandonments by Using Value Extrapolation Method. RAIRO-Oper. Res. 53, 767–786 (2019).
Kyung, C. Chae, Hyun, M. Park & Won, S. Yang A GI∣Geo∣1 Queue with Negative and Positive Customers. Appl. Math. Model. 34, 1662–1671 (2010).
Wang, J., Huang, Y. & Dai, Z. A Discrete-Time On-Off Source Queueing System with Negative Customers. Comput. Ind. Eng. 61, 1226–1232 (2011).
Gao, Sh, Wang, J. & Zhang, D. Discrete-Time GIX∣Geo∣1∣N Queue with Negative Customers and Multiple Working Vacations. J. Korean Stat. Soc. 42, 515–528 (2013).
Wang, J., Huang, Y. & Do, T. A Single-Server Discrete-Time Queue with Correlated Positive and Negative Customer Arrivals. Appl. Math. Model. 37, 6212–6224 (2013).
Lee, D.H. and Kim, K.Analysis of Repairable Geo∣G∣1 Queues with Negative Customers, Appl. Math. Model., 2014, Article ID 350621.
Senthil, VadivuA., Arumuganathan, R. & Senthil, KumarM. Analysis of Discrete-Time Queues with Correlated Arrivals, Negative Customers and Server Interruption. RAIRO-Oper. Res. 50, 67–81 (2016).
Klimenok, V. I. & Dudin, A. N. A BMAP∣PH∣N Queue with Negative Customers and Partial Protection of Service. Commun. Statist. Simulat. Comput. 41(no. 7), 1062–1082 (2012).
Rajadurai, P., Chandrasekaran, M. & Saravanarajan, M. C. Steady State Analysis of Batch Arrival Feedback Retrial Queue with Two Phases of Service, Negative Customers, Bernoulli Vacation and Server Breakdown. Int. J. Math. Oper. Res. 7, 519–546 (2015).
Singh, C.J., Jain, M., Kaur, S., and Meena, R.K.Retrial Bulk Queue with State Dependent Arrival and Negative Customers, Proc. Sixth Int. Conf. on Soft Computing for Problem Solving: SocProS 2016, vol. 2: Advances in Intelligent Systems and Computing, Patiala, India, Switzerland: Springer, 2017, vol. 547, pp. 290–301.
Ayyappan, G. and Thamizhselvi, P.Transient Analysis of \({M}^{[{X}_{1}]},{M}^{[{X}_{2}]}/{G}_{1},{G}_{2}/1\) Retrial Queueing System with Priority Services, Working Vacations and Vacation Interruption, Emergency Vacation, Negative Arrival and Delayed Repair, Int. J. Appl. Comput. Math., 2018, vol. 4, article number 77.
Matalytski, M. A. Forecasting Anticipated Incomes in the Markov Networks with Positive and Negative Customers. Autom. Remote Control 78(no. 5), 815–825 (2017).
Lee, D.H.Optimal Pricing Strategies and Customers’ Equilibrium Behavior in an Unobservable M∣M∣1 Queueing System with Negative Customers and Repair, Math. Probl. Eng., 2017, article ID 8910819.
Matalytski, M. Finding Expected Revenues in G-network with Multiple Classes of Positive and Negative Customers Probability in the Engineering and Informational Sciences. Prob. Eng. Inform. Sci. 33(no. 1), 105–120 (2019).
Matalytski, M. Analysis of the Network with Multiple Classes of Positive and Negative Customers at a Transient Regime. Prob. Eng. Inform. Sci. 33(no. 2), 172–185 (2019).
Sun, K. & Wang, J. Equilibrium Joining Strategies in the Single Server Queues with Negative Customers. Int. J. Comput. Math. 96(no. 6), 1169–1191 (2019).
Xiu-li, Xu, Xian-ying, Wang, Xiao-feng, Song & Xiao-qing, Li Fluid Model Modulated by an M∣M∣1 Working Vacation Queue with Negative Customer. Acta. Math. Appl. Sin.-E. 34(no. 2), 404–415 (2018).
Chin, C.H., Koh, S.K., Tan, Y.F., Pooi, A.H., and Goh, Y.K.Stationary Queue Length Distribution of A Continuous-Time Queueing System with Negative Arrival, J. Phys. Conf., 2018, vol. 1132, article ID 012057.
Peng, Y. The MAP/G/1 G-queue with Unreliable Server and Multiple Vacations. Informatica 43(no. 4), 545–550 (2019).
Gupta, U., Kumar, N., and Barbhuiya, F.A Queueing System with Batch Renewal Input and Negative Arrivals, arXiv:2002.08209v1, 2020.
Kreinin, A. Queueing Systems with Renovation. J. Appl. Math. Stoch. Anal. 10(no. 4), 431–443 (1997).
Bocharov, P. P. & Zaryadov, I. S. Queueing Systems with Renovation. Stationary Probability Distribution. Vest. Ross. Univ. Druzh. Narod., Ser. "Mat. Informat. Fiz.” no. 1-2, 14–23 (2007).
Zaryadov, I. S. & Pechinkin, A. V. Stationary Time Characteristics of the GI∣M∣n∣∞ System with Some Variants of the Generalized Renovation Discipline. Autom. Remote Control 70(no. 12), 2085–2097 (2009).
Zaryadov, I. S. The GI∣M∣n∣∞ Queuing System with Generalized Renovation. Autom. Remote Control 71(no. 4), 663–671 (2010).
Grishunina, Y. B. Optimal Control of Queue in the M∣G∣1∣∞ System with Possibility of Customer Admission Restriction. Autom. Remote Control 76(no. 3), 433–445 (2015).
Agalarov, Ya. M. & Shorgin, V. S. About the Problem of Profit Maximization in G∣M∣1 Queuing Systems with Threshold Control of the Queue. Informat. Primen. 11(no. 4), 55–64 (2017).
Konovalov, M. G. & Razumchik, R. V. Comparison of Two Active Queue Management Schemes through the M∣D∣1∣N Queue. Inform. Appl. 12(no. 4), 9–15 (2018).
Adams, R. Active Queue Management: A Survey. IEEE Commun. Surveys Tutorials 15(no. 3), 1425–1476 (2013).
Sh, Anup & Ashok, B. A Survey on Active Queue Management Techniques. Int. J. Eng. Comput. Sci. 5, 18993–18997 (2016).
White, H. & Christie, LeeS. Queuing with Preemptive Priorities or with Breakdown. Oper. Res. 6(no. 1), 79–95 (1958).
Zaryadov, I. S. & Gorbunova, A. V. Analysis of the Characteristics of a Queueing System with Two Input Flows, Non-Preemptive Priority, and Dropping. Sovr. Inform. Tekhnol. IT-Obrazovanie no. 10, 388–393 (2014).
Zaryadov, I. S. & Gorbunova, A. V. The Analysis of Queueing System with Two Input Flows and Stochastic Drop Mechanism. Bull. Peopl. Friends. Univ. Russ., Ser. Math., Informat., Phys. no. 2, 33–37 (2015).
Zaryadov, I. S. & Korol’kova, A. V. The Application of Model with General Renovation to the Analysis of Characteristics of Active Queue Management with Random Early Detection (RED). T-Comm–Telekom. Transport no. 7, 84–88 (2011).
Chydzinski, A. and Mrozowski, P.Queues with Dropping Functions and General Arrival Processes, PLoS ONE, 2016, vol. 11, article ID 0150702.
Wang, Y., Lin, Ch, Li, Q.-L. & Fang, Y. A Queueing Analysis for the Denial of Service (DoS) Attacks in Computer Networks. Comput. Networks 51, 3564–3573 (2007).
Imamverdiyev, Y. & Nabiyev, B. Queuing Model for Information Security Monitoring Systems. PIT 07(no. 1), 28–32 (2016).
Kammas, P., Komninos, T., and Stamatiou, Y.C.Queuing Theory Based Models for Studying Intrusion Evolution and Elimination in Computer Networks, Fourth Int. Conf. on Information Assurance and Security, Napoli, Italy, 2008, pp. 167–171.
Ariba, Y., Gouaisbaut, F., Rahme, S. & Labit, Y. Traffic Monitoring in Transmission Control Protocol/Active Queue Management Networks through a Time-Delay Observer. IET Control Theory A 6(no. 2), 506–517 (2012).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gorbunova, A., Lebedev, A. Queueing System with Two Input Flows, Preemptive Priority, and Stochastic Dropping. Autom Remote Control 81, 2230–2243 (2020). https://doi.org/10.1134/S0005117920120073
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117920120073