Skip to main content
Log in

Diffusion approximation in closed queueing systems

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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. D. P. Gaver and G. S. Shedler, “Processor utilization in multiprogramming,” in: Systems via Diffusion Approximation, Oper. Res., 21(2) (1971).

  2. D. P. Gaver and G. S. Shedler, “Approximate models for processor utilization in multi-programmed computer systems,” SIAM J. Comput.,2, No. 3, 183–192 (1973).

    Google Scholar 

  3. H. Kobayashi, “Application of the diffusion approximation to queueing networks. I,” J. Assoc. Comput. Mach.,21, No. 2, 316–328 (1974); II. J. Assoc. Comput. Mach.,23, No. 3, 459–469 (1974).

    Google Scholar 

  4. M. Ret, “Diffusion approximation for a certain multiprogramming system,” in: Fourth Internat. Symp. on Information Theory. Abstract of Proceedings, Part 1, Moscow-Leningrad (1971), pp. 165–167.

  5. A. A. Samarskii, Introduction to the Theory of Difference Schemes [in Russian], Nauka, Moscow (1971).

    Google Scholar 

Download references

Authors

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 7, pp. 95–102, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Begovatov, E.A., Lapin, A.V. Diffusion approximation in closed queueing systems. J Math Sci 43, 2481–2485 (1988). https://doi.org/10.1007/BF01095656

Download citation

  • Issue Date:

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

Keywords

Navigation