We consider closed multichain product form queueing networks which have at least one
infinite server service center. When modeling interactive computer systems an infinite server …

In Section 4 of our paper we proposed an iterative algorithm to compute approximate values
for mean queue sizes, mean waiting times, and throughputs in closed multichain queuing …

Hierarchical decomposition methods for approximating response time distributions in certain
closed queueing network models of computer performance are investigated. The methods …

Abstract Evaluation of closed queueing networks with product form solutions is very time-
consuming if the population sizes or the network size is large. This paper provides an …

Queueing networks are important as performance models of computer and communication
systems because the performance of these systems is usually principally affected by …

In this paper a method for calculating the first and higher order moments of the queue
lengths for each customer class at each node in a dosed Markovian queuing network is …

An asymptotic method is described for analyzing the performance of closed, multiple class
queueing networks. The networks consist of an infinite server or terminal node, a large …

We consider mathematical models of multiprogrammed computer systems expressed in the
form of closed queueing networks. Such models have traditionally required detailed …

Closed Markovian networks of queues that have the product form in their stationary
probability distributions are useful in the performance evaluation and design of computer …

The use of queueing network models to analyze the performance of computer systems is
widespread. Typically the analysis requires certain assumptions to be made. Even under …