Skip to main content
SpringerLink
Log in

An iterative method for computing closed queueing networks

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

Abstract

An iterative method is proposed for calculating closed queueing networks. The method successively calculates the state probabilities of each server treated as a closed queueing system.

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

Literature Cited

  1. D. M. Sologub, Automobile Transport for Industry [in Russian], Vishcha Shkola, Kiev (1973).

    Google Scholar 

  2. A. Kaufmann and R. Cruon, Queueing. Theory and Applications [Russian translation], Mir, Moscow (1965).

    Google Scholar 

Download references

Authors
  1. D. M. Sologub
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 181–183, March–April, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sologub, D.M. An iterative method for computing closed queueing networks. Cybern Syst Anal 28, 319–322 (1992). https://doi.org/10.1007/BF01126222

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation