Analysis of Closed Queueing Networks with Batch Service

We consider a closed queuing network with batch service and movements of customers in continuous time. Each node in the queueing network is an infinite capacity single server queueing system under a RANDOM discipline. Customers move among the nodes following a routing matrix. Customers are served in batches of a fixed size. If a number of customers in a node is less than the size, the server of the system is idle until the required number of customers arrive at the node. An arriving at a node customer is placed in the queue if the server is busy. The batch service time is exponentially distributed. After a batch finishes its execution at a node, each customer of the batch, regardless of other customers of the batch, immediately moves to another node in accordance with the routing probability. This article presents an analysis of the queueing network using a Markov chain with continuous time. The qenerator matrix is constructed for the underlying Markov chain. We obtain expressions for the performance measures. Some numerical examples are provided. The results can be used for the performance analysis manufacturing systems, passenger and freight transport systems, as well as information and computing systems with parallel processing and transmission of information.