Skip to main content
Log in

A cyclic queueing system

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. M. A. Leibowitz, “An approximate method for treating a class of multiqueue problems,” IBM J. Res. Develop.5, No. 3 (1961).

  2. M. D. Moustafa, “Input-Output Markov processes,” Proc. Kon. Ned. Ak. U. Wet,A- 60, No. 1 (1957).

  3. G. P. Klimov, Stochastic Queueing Systems [in Russian], Nauka, Moscow (1966).

    Google Scholar 

  4. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 2nd edition, Wiley (1950).

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 94–100, November–December, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vinnitskii, V.P., Brodetskii, G.L. A cyclic queueing system. Cybern Syst Anal 8, 979–987 (1972). https://doi.org/10.1007/BF01068524

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation