Mean-value analysis of queueing networks: a time-recurrent approach

MaRDI QIDQ1881901zbMATH OpenFDO

Authors M. A. Matalytskiĭ

Publication date 18 October 2004

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

queueing networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

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.

Recommendations

• Mean value analysis of closed queueing networks with Erlang service time distributions
• Limit Theorems for Queueing Networks. I
• scientific article; zbMATH DE number 1179596
• scientific article; zbMATH DE number 3941235
• Integral method for calculating closed queueing networks

Cited in

(2)

• On some results in analysis and optimization of Markov networks with incomes and their applications
• scientific article; zbMATH DE number 1179596 (Why is no real title available?)

This page was built for publication: Mean-value analysis of queueing networks: a time-recurrent approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881901)