Published online by Cambridge University Press: 01 July 2016
Queueing networks have been rather restricted in order to have product form distributions for network states. Recently, several new models have appeared and enlarged this class of product form networks. In this paper, we consider another new type of queueing network with concurrent batch movements in terms of such product form results. A joint distribution of the requested batch sizes for departures and the batch sizes of the corresponding arrivals may be arbitrary. Under a certain modification of the network and mild regularity conditions, we give necessary and sufficient conditions for the network state to have the product form distribution, which is shown to provide an upper bound for the one in the original network. It is shown that two special settings satisfy these conditions. Algorithms to calculate their stationary distributions are considered, with numerical examples.