Skip to main content
SpringerLink
Log in

Synthesis of Closed Queueing Networks with Several Classes of Messages on the Basis of Their Optimization and Balancing

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The optimization and balancing problems formulated in the author's previous works are theoretically investigated for queueing networks with several classes of messages. The necessary and sufficient conditions of the global optimal solution of these problems are obtained. It is shown that the method of Lagrangian multipliers can be used in solving them.

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

Similar content being viewed by others

REFERENCES

  1. A. I. Gerasimov, The Theory and Practical Use of Stochastic Networks [in Russian], Radio i Svyaz', Moscow (1994).

    Google Scholar 

  2. A. I. Gerasimov, “On normalizing constants in multiclass queueing networks,” Oper. Res., 43, No. 4, 704-711 (1995).

    Google Scholar 

  3. A. I. Gerasimov, “An integral method of computation of closed queueing networks,” Probl. Peredachi Inf., 28, No. 2, 96-108 (1992).

    Google Scholar 

  4. A. I. Gerasimov, “Optimization of closed queueing networks with several classes of messages,” Probl. Peredachi Inf., 30, No. 1, 85-96 (1994).

    Google Scholar 

  5. A. I. Gerasimov, “On normalizing constants for multilinear networks with several classes of messages,” Avtomat. Telemekh., No. 5, 119-130 (1993). (A. I. Gerasimov, “On normalizing constants of multi-server networks with several customer classes. II,” Automation and Remote Control, 54, No. 5, 812-820 (1993).)

  6. T. G. Price, Probability models of multiprogrammed computer systems, Ph.D. Dissertation, Dept. Elec. Eng., Stanford Univ., Palo Alto, CA (1974).

    Google Scholar 

  7. K. Yoneyama and T. Nishida, “A note on the concavity or the convexity of performance measures of two-stage finite tandem queue,” Mathematica Japonica, 42, No. 2, Whole No. 173, 213-218 (1995).

    Google Scholar 

  8. K. S. Trivedi and R. A. Wagner, “A decision model for closed queuing networks,” IEEE Trans. Software Eng., SE-5, No. 4, 328-332 (1979).

    Google Scholar 

  9. H. Kameda and Y. Zhang, “Uniqueness of the solution for optimal static routing in open BCMP queueing networks,” Math. Computer Modeling, 22, No. 10-12, 119-130 (1995).

    Google Scholar 

  10. K. M. Bretthauer, “Capacity planning in manufacturing and computer networks,” Eur. J. Oper. Res., 91, No. 2, 386-394 (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering and Technological Informatics, Russian Academy of Sciences, Moscow, Russia

    A. I. Gerasimov

Authors
  1. A. I. Gerasimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerasimov, A.I. Synthesis of Closed Queueing Networks with Several Classes of Messages on the Basis of Their Optimization and Balancing. Cybernetics and Systems Analysis 36, 906–915 (2000). https://doi.org/10.1023/A:1009417712791

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009417712791

Search

Navigation