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

Authors:
A. I. Gerasimov
Affiliations:
Institute of Engineering and Technological Informatics, Russian Academy of Sciences, Moscow, Russia
Venue:
Cybernetics and Systems Analysis
Year:
2000

Citing 2
Cited 1

Probability models of multiprogrammed computer systems.

Probability models of multiprogrammed computer systems.
Uniqueness of the solution for optimal static routing in open BCMP queueing networks

Mathematical and Computer Modelling: An International Journal

A Model of a Microprocessor with a Wide Command Word

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.