Multi-class Product Form Closed Queueing Networks Under Heavy Loading Conditions

Asymptotic expressions for the values of throughputs, utilizations, mean cycle time, and mean queue lengths are derived for certain types of multi-class queueing networks with load independent stations. The results appear as extensions of their well known counterparts in single-class queueing networks. In the case of multi-class queueing networks with multiple distinct bottlenecks these asymptotic expressions are obtained using a conjecture. Numerical results are provided that sustain the validity of the conjecture.