We fonnulate an approximate recursive relation for the sojourn time, queuelength and throughput of a multi server station, embedded in a closed queueing network. Based on that relation, we derive a mean value approximation and formulate a Schweitzer approximation for solving large networks. Numerical examples show that the approximate mean value algorithm yields accurate results
