Mean value analysis of closed queueing networks with Erlang service time distributions

The classical mean value analysis approach is extended to single class closed queueing networks containing Erlang service time distributions and FCFS scheduling disciplines. A new formula for the mean residence time of jobs is derived. Each iteration provides self-checks for validity, and is repeated whenever invalid results are detected. On the average, the solutions obtained vary by less than five percent from their respective simulation results.