Skip to main content
Log in

Markov queueing system with finite buffer and negative customers affecting the queue end

  • Data Transmission in Computer Networks
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A multiserver queueing system with finite buffer, Markov input flow, and Markov (general) service process of all customers on servers with the number of process states and intensities of inter-phase transitions depending on the number of customers in the system is considered. A Markov flow of negative customers arrives to the system; one negative customer “kills” one positive customer at the end of the queue. A recurrent algorithm for computing stationary probabilities of system states is obtained; and a method for calculating stationary distribution of waiting time before starting service of a positive customer is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gelenbe, E., Random Neural Networks with Positive and Negative Signals and Product Form Solution, Neur. Comput., 1989, vol. 1, pp. 502–510.

    Article  Google Scholar 

  2. Gelenbe, E., Reseaux Neuronaux Aleatoires Stables, Comptes-Rendus Acad. Sci. II, 1990, vol. 310, pp. 177–180.

    MathSciNet  Google Scholar 

  3. Gelenbe, E. and Pujolle, G., Introduction to Queueing Networks, New York: Wiley, 1998.

    Google Scholar 

  4. Artalejo, J.R., G-networks: A Versatile Approach for Work Removal in Queueing Networks, Eur. J. Oper. Res., 2000, vol. 126, pp. 233–249.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bocharov, P.P. and Vishnevskii, V.M., G-Networks: Development of the Theory of Multiplicative Networks, Avtom. Telemekh., 2003, no. 5, pp. 46–74.

  6. Baskett, F., Chandy, K.M., Muntz, R.R., et al., Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, J. ACM, 1975, vol. 22, pp. 248–260.

    Article  MATH  MathSciNet  Google Scholar 

  7. Shin, Y., Multiserver Retrial Queue with Negative Customers and Disasters, Proc. of the Fifth Internat. Workshop on Retrial Queues, Seoul: Korea Univ., 2005, pp. 53–60.

    Google Scholar 

  8. Anisimov, V. and Artalejo, J., Analysis of Markov Multiserver Retrial Queues with Negative Arrivals, Queueing Syst., 2001, vol. 39, pp. 157–182.

    Article  MATH  MathSciNet  Google Scholar 

  9. Chaplygin, V.V., Stationary Characteristics of the G/MSP/n/r Queueing System with the Flow of Negative Customers, Inform. Processes, 2005, vol. 5, no. 1, pp. 1–19.

    Google Scholar 

  10. Bocharov, P.P., d’Apice, C., Manzo, R., and Pechinkin, A.V., Analysis of the Multiserver Markov Queueing System with Unlimited Buffer and Negative Customers, Avtom. Telemekh., 2007, no. 1, pp. 93–104.

  11. Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.

    Google Scholar 

  12. Pechinkin, A.V. and Chaplygin, V.V., Stationary Characteristics of the SM/MSP/n/r Queueing System, Avtom. Telemekh., 2004, no. 9, pp. 85–100.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © A.V. Pechinkin, 2007, published in Informatsionnye Protsessy, 2007, Vol. 7, No. 2, pp. 138–152.

This work was supported by the Russian Foundation for Basic Research, projects nos. 06-07-89056 and 05-07-90103.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pechinkin, A.V. Markov queueing system with finite buffer and negative customers affecting the queue end. Autom Remote Control 68, 1104–1117 (2007). https://doi.org/10.1134/S0005117907060173

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117907060173

PACS numbers

Navigation