Skip to Main Content
The paper deals with queuing networks with window flow control and group arrivals. By using the method of entropy maximisation, an equivalent arrival process is obtained and is then applied to study queuing networks. The authors consider the networks of single-server nodes in both continuous and discrete time, and multiple exponential-server nodes in continuous time. Numerical results are obtained for the mean number of packets at the nodes, the server utilisations and the network throughput. It is shown that the calculated results agree favourably with the simulation results.