RUS  ENG
Full version
JOURNALS // Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika" // Archive

Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 1983 Volume 21, Pages 3–119 (Mi intv56)

This article is cited in 18 papers

Theory of queuing networks and its applications to the analysis of information-computing systems

G. P. Basharin, A. L. Tolmachev


Abstract: The present survey reflects the main results obtained through 1982 in the theory of queuing networks and some of its applications to the analysis of the productivity of information-computing systems. Special attention is devoted to as complete a description as possible of models of networks for which there exist closed expressions for the stationary distributions. The characteristic properties of such networks are studied, and effective computing algorithms are given for computing the characteristics. A number of approximate methods are presented which are used in analytic modeling of real information-computing systems — networks of data transmission and networks of computers and their components.

UDC: 519.248:681.5


 English version:
Journal of Soviet Mathematics, 1985, 29:1, 951–1050

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024