A queuing system with one service unit and Poisson flows of positive and negative claims is considered. There is an infinite buffer for positive claims. A negative claim arriving at the system knocks out a positive claim waiting in the buffer and moves it to another infinite buffer (bunker). The claims from bunker are served with relative priority. If upon arrival of negative claim the buffer is empty, it leaves the system without affecting it. The service times for claims from buffer and bunker have exponential distributions with different parameters. A new method that provides efficient calculation of stationary distribution of the number of customers in buffer and bunker is proposed.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Van Do Tien, “An Initiative for a Classified Bibliography on G-networks,” Performance Evaluation 68, 385–394 (2011).
R. Mandzo, N. Kaskone, and R. V. Razumchik, “An Exponential Queuing System with Negative Claims and a Bunker for Superseded Claims,” Avtom. Telemekh., No. 9, 103–113 (2008).
A. V. Pechinkin and R. V. Razumchik, “On Waiting Period under Certain Service Disciplines in a System with Negative Claims and a Bunker,” in Queues: Flows, Systems, Networks. Proc. Int. Conf. “Modern Probabilistic Methods for Analysis and Optimization of Information and Telecommunication Networks,” Minsk, Belarus, Jan., 2011 (Belarus. State Univ., Minsk, 2011), pp. 207–212 (2011).
A. V. Pechinkin and R. V. Razumchik, “A Queuing System with Negative Claims and a Bunker for Superseded Claims in Discrete Time,” Avtom. Telemekh., No. 12, 109–120 (2009).
A. V. Pechinkin and R. V. Razumchik, “Waiting Characteristics of Queueing System Geo|Geo|1 with Negative Claims and a Bunker for Superseded Claims in Discrete Time,” in Proc. 2010 Int. Conf. on Ultra Modern Telecommunications, Moscow (Russia), Oct. 18–20, 2010 (IEEE, New York, 2010), pp. 1051–1055.
R. V. Razumchik, “A Queuing System with Negative Claims and a Bunker for Superseded Claims and Different Service Intensities,” Informatika Primenen. 5(3), 39–43 (2011).
J. Abate and W. Whitt, “Numerical Inversion of Probability Generating Functions,” Oper. Res. Lett. 12, 245–251 (1992).
V. Ramaswami, “A Stable Recursion for the Steady State Vector in Markov Chains of M|G|1 Type,” Comm. Statist. Stochastic Models 4(1), 183–188 (1988).
M. F. Neuts, Structured Stochastic Matrices of M-G-1 Type and Their Applications (Marcel Dekker, New York, 1989).
P. P. Bocharov and A. V. Pechinkin, Queueing Theory (RUDN, Moscow, 1995) [in Russian].
Original Russian Text © A.V. Pechinkin, R.V. Razumchik, 2012, published in Informatsionnye Protsessy, 2012, Vol. 12, No. 1, pp. 53–67.
About this article
Cite this article
Pechinkin, A.V., Razumchik, R.V. 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. Electron. 57, 882–891 (2012). https://doi.org/10.1134/S1064226912080037