Informatics and Applications
2015, Volume 9, Issue 4, pp 68-77
ALGEBRAIC METHOD FOR APPROXIMATING JOINT STATIONARY DISTRIBUTION IN FINITE CAPACITY QUEUE WITH NEGATIVE CUSTOMERS AND TWO QUEUES
Abstract
Consideration is given to the single-server queueing system (QS) with a Poisson flow of (ordinary) customers and Poisson flow of negative customers. There is a queue of capacity k (0 < k < to), where ordinary customers wait for service. If an ordinary customer finds the queue full upon an arrival, it is considered to be lost. Each negative customer upon arrival moves one ordinary customer from the queue, if it not empty, to another queue (bunker) of capacity r (0 < r < to) and after that it leaves the system. If upon arrival of a negative customer the queue is not empty and the bunker is full, the negative customer and one ordinary customer from the queue leave the system. In all other cases, an arrival of a negative customer has no effect on the system. Customers from bunker are served with relative priority (i. e., a customer from bunker enters server if only there are no customers in the queue to be served). Service times of customers from both the queue and the bunker are exponentially distributed with the same parameter. Purely algebraic method based on generating functions, Chebyshev and Gegenbauer polynomials for approximate calculation of joint stationary probability distribution is presented for the case k = r. Numerical examples, showing both pros and cons of the method are provided.
[+] References (25)
- Gelenbe, E., P. Glynn, andK. Sigman. 1991. Queues with negative arrivals. J. Appl. Probab. 28:245-250.
- Gelenbe, E. 1993. G-networks with instantaneous customer movement. J. Appl. Probab. 30(3):742-748.
- Harrison, P. G., and E. Pitel. 1993. Sojourn times in single-server queues with negative customers. J. Appl. Probab. 30:943-963.
- Fourneau, J., E. Gelenbe, andR. Suros. 1996. G-networks with multiple classes of negative and positive customers. Theor. Comput. Sci. 155(1):141-156.
- Artalejo, J. R. 2000. G-networks: A versatile approach for work removal in queueing systems. Eur. J. Oper. Res. 126:233-249.
- Bocharov, P. P., and V. M. Vishnevskii. 2003. G-networks: Development of the theory of multiplicative networks. Automat. Rem. Contr. 64(5):714-739.
- Boucherie, R. J., and N. van Dijk, eds. 2011. Queueing networks: A fundamental approach. International ser. in operations research and management science. New York, NY: Springer. 154. 800 p.
- Van Do, T. 2011. An initiative for a classified bibliography on G-networks. Perform. Evaluation 68(4):385-394.
- Suetin, P. K. 1979. Klassicheskie ortogonal'nye mnogochle- ny [Classical orthogonal polynomials]. Moscow: Nauka. 416 p.
- Manzo, R., N. Cascone, and R.V. Razumchik. 2008. Exponential queuing system with negative customers and bunker for ousted customers. Automat. Rem. Contr. 69:1542-1551.
- Klimenok, V., and A. Dudin. 2012. A BMAP/PH/N queue with negative customers and partial protection of service. Commun. Stat. Simulat. 41(7):1062-1082.
- Pechinkin, A. V., and R.V. Razumchik. 2012. Stationary waiting time distribution in queueing system with negative customers and bunker for ousted customers under Last- LIFO-LIFO service discipline. J. Commun. Technol. El. 57(12):1331-1339.
- Pechinkin, A. V., and R.V. Razumchik. 2012. A method for calculating stationary queue distribution in a queuing system with flows of ordinary and negative claims and a bunker for superseded claims. J. Commun. Technol. El. 57(8):882-891.
- Dao-Thi, T, J. Fourneau, and M. Tran. 2013. Networks of order independent queues with signals. 21st Symposium (International) on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Proceedings. 131-140.
- Krishna Kumar, B., S. Pavai Madheswari, and S. R. Anan- tha Lakshmi. 2013. An M/G/1 Bernoulli feedback retrial queueing system with negative customers. Oper. Res. 13(2):187-210.
- Razumchik, R. V. 2013. Statsionarnoe raspredelenie vre- meni ozhidaniya v sisteme obsluzhivaniya s otritsatel'nymi zayavkami, bunkerom dlya vytesnennykh zayavok, raz- lichnymi intensivnostyami obsluzhivaniya pri discipline First-FIFO-FIFO [Stationary waiting time distribution in queueing system with negative customers and bunker for ousted customers under First-FIFO-FIFO service discipline]. Informatika i ee Primenenija - Inform. Appl. 7(2):34-39.
- Razumchik, R. V. 2014. Analysis of finite capacity queue with negative customers and bunker for ousted customers using chebyshev and gegenbauer polynomials. Asia Pac. J. Oper. Res. 31(4):1450029. 21 p.
- Van Do, T, D. Papp, R. Chakka, J. Sztrik, and J. Wang. 2014. M/M/1 retrial queue with working vacations and negative customer arrivals. Int. J. Adv. Intelligence Paradigms 6(1):52-65.
- Razumchik, R., and M. Telek. 2015. Delay analysis of a queue with re-sequencing buffer and Markov environment. Queueing Syst. 22 p. doi: 10.1007/S 11134-015- 9444-Z.
- Balsamo, S., P. G. Harrison, and A. Marin. 2010. A unifying approach to product-forms in networks with finite capacity constraints. SIGMETRICS 38(1):25-36.
- Harrison, P. G., and A. Marin. 2014. Product-forms in multi-way synchronisations. Comput. J. 57(11):1693- 1710.
- Avrachenkov, K. E., N. O. Vilchevsky, and G. L. Shevl- jakov. 2003. Priority queueing with finite buffer size and randomized push-out mechanism. ACM Conference (In-ternational) on Measurement and Modelling of Computer Proceedings. San Diego. 324-335.
- Ilyashenko, A., O. Zayats, V. Muliukha, and L. Laboshin. 2014. Further investigations of the priority queuing system with preemptive priority and randomized push-out mech-anism. Internet of things, smart spaces, and next generation networks and systems. Eds. S. Balandin, S. D. Andreev, and Y. Koucheryavy. Lecture notes in computer science ser. Springer. 8638:433-443.
- Gil, A., J. Seguram, and N. M. Temme. 2007. Numerical methods for special functions. Philadelphia, PA: Society for Industrial and Applied Mathematics. 431 p.
- Erdelyi, A., and H. Bateman. 1985. Higher transcendental functions. II. Malabar: Robert E. Krieger Publishing Co. 396 p.
[+] About this article
Title
ALGEBRAIC METHOD FOR APPROXIMATING JOINT STATIONARY DISTRIBUTION IN FINITE CAPACITY QUEUE WITH NEGATIVE CUSTOMERS AND TWO QUEUES
Journal
Informatics and Applications
2015, Volume 9, Issue 4, pp 68-77
Cover Date
2015-11-30
DOI
10.14357/19922264150407
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
queueing system; negative customers; Gegenbauer polynomials; stationary distribution; approximation
Authors
R. V. Razumchik  , 
Author Affiliations
Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Peoples' Friendship University of Russia, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
|