Throughput of Queueing Networks on Based Discrete review policy

This paper is analyzed one of the closed multi-class queueing networks model by using the discrete review policies. The size of the batches is selected in the network according to discrete uniform distribution and is served according to Erlang distribution. Our aim is to obtain model performance measures when the number of jobs in the system is fixed, the generating parameter of service times is changed, calculate the efficiency measures of the network by using discretereview policies results through an example.