Asymptotic Analysis of Multiclass Closed Queueing Networks: Common Bottleneck

Abstract Asymptotic expressions for the values of throughputs, utilizations, mean cycle times, and mean queue lengths are derived for certain types of multiclass queueing networks with load independent stations. The relation between these results and their counterparts for single class queueing networks are analysed. The behaviours of the performance figures derived for each individual class are discussed with an emphasis on the presence of correction factors in the limit expressions for the response times. Extrapolations of the limit results to finite population values are proposed as approximations of the actual behaviour of the network for intermediate load conditions. Numerical values are presented to substantiate the practical relevance of these results.

[1]  Gianfranco Balbo,et al.  Computational algorithms for closed queueing networks , 1980 .

[2]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[3]  Stephen S. Lavenberg.  Closed Multichain Product Form Queueing Networks with Large Population Sizes , 1981 .

[4]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[5]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[6]  Giuseppe Serazzi,et al.  Multi-class Product Form Closed Queueing Networks Under Heavy Loading Conditions , 1987 .

[7]  Paul J. Schweitzer.  Bottleneck Determination in Networks of Queues , 1982 .

[8]  Lester Lipsky,et al.  On the asymptotic behavior of time-sharing systems , 1982, CACM.

[9]  Boris G. Pittel,et al.  Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis , 1979, Math. Oper. Res..

[10]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[11]  Giuseppe Serazzi,et al.  Asymptotic Analysis of Multiclass Closed Queueing Networks: Multiple Bottlenecks , 1997, Perform. Evaluation.

[12]  Teemu Kerola.  The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments , 1986, Perform. Evaluation.

[13]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[14]  K. Mani Chandy,et al.  Linearizer: a heuristic algorithm for queueing network models of computing systems , 1982, CACM.

[15]  Derek L. Eager,et al.  Performance bound hierarchies for queueing networks , 1982, TOCS.

[16]  Derek L. Eager,et al.  Bound hierarchies for multiple-class queuing networks , 1986, JACM.

[17]  John Zahorjan,et al.  Balanced job bound analysis of queueing networks , 1982, CACM.

[18]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.