Mean-value analysis of queueing networks: a time-recurrent approach
type: Item
instance of: scholarly article
title: Mean-value analysis of queueing networks: a time-recurrent approach
zbMATH Open document ID: 1057.60089
published in: Automation and Remote Control
publication date: 2004-10-18T00:00:00Z
review text: The author declares that he designs a new method for determining the mean characteristics of networks both in stationary and transient modes. In fact, the paper considers closed service networks with a fixed number of inputs and focuses attention on a) intensity of input flow on a given service system; b) mean number of inputs and c) mean residence time of inputs in this service system. Theorem 1 states that convergence of any considered characteristics is followed by convergence of others. It is worth to note that in proving Theorem 1 the Cauchy test is used incorrectly, so this theorem is not proved.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 2108460
zbMATH Keywords: queueing networks
author: M. A. Matalytskiĭ
reviewed by: Oleg K. Zakusilo
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2108460