Skip to main content
SpringerLink
Log in

A queueing system with invariant state probabilities

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. V. Pechinkin, A. D. Solov'ev, and S. F. Yashkov, “On a system in which the request with the shortest remaining length is serviced first,” Izv. Akad, Nauk SSSR, Tekh. Kibern., No. 5, 51–58 (1979).

    Google Scholar 

  2. A. V. Pechinkin, “On an invariant queueing system,” Matemat. Operationsforsch. Statist., Ser. Optimisation, No. 3, 433–444 (1983).

    Google Scholar 

  3. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queueing Theory [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  4. A. G. Tatashev, “Multichannel queueing system with shortest-request losses,” Avtomat. Telemekh., No. 7, 187–189 (1991).

    Google Scholar 

  5. F. P. Kelly, “Networks of queues,” Adv. Appl. Prob.,24, No. 2, 250–263 (1976).

    Google Scholar 

  6. V. F. Matveev and V. G. Ushakov, Queueing Systems [in Russian], Moscow State Univ. (1984).

Download references

Authors
  1. A. G. Tatashev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 183–186, September–October, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tatashev, A.G. A queueing system with invariant state probabilities. Cybern Syst Anal 29, 789–792 (1993). https://doi.org/10.1007/BF01125811

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01125811

Keywords

Search

Navigation