ASYMPTOTIC ANALYSIS OF MULTICLASS CLOSED QUEUING-NETWORKS - MULTIPLE BOTTLENECKS

Asymptotic expressions for the values of throughputs, utilizations, me an queue lengths, and mean cycle times are derived for multiclass prod uct-form queueing networks with load independent servers, where differ ent (sets of) stations may behave as bottlenecks when different popula tion mixes load the network. The space of possible population mixes is shown to be partitioned into sectors within which several stations ma y saturate together. Analytic expressions for the computation of the e dges of these sectors are provided. A synthesis of a large set of expe riments is presented to numerically support a conjecture that is used to perform the asymptotic analysis of this class of networks. (C) 1997 Elsevier Science B.V.