Queueing networks with window flow control and bulk arrivals are discussed. The effect of acknowledgment delay is also considered. Using the method of maximum entropy, we provide an iterative algorithm to obtain numerical results for the network throughput, utilization and average number of packets at the nodes. It is shown that the analytic results agree favourably with simulation results.
