A Product-Form Approximation Method for General Closed Queueing Networks with Several Classes of Customers

Abstract This paper presents a new method for obtaining approximate solutions of general closed queueing networks with several classes of customers. The idea is to associate with each class of customers, a single-class closed queueing network with load-dependent exponential service stations. For each single-class network associated with a particular class of customers, the interactions with the customers belonging to other classes are taken into account in the estimation of the load-dependent service rates. These parameters are obtained by analyzing each station in isolation under the assumption that the arrival process of each class is a state-dependent Markovian process. An iterative algorithm is used to determine the unknown parameters. The main computational charge of the method is due to the analysis of the stations in isolation. A class aggregation technique is proposed that significantly reduces the complexity of these analyses. Although the principle of the method is fairly general, in this paper we only consider queueing networks with general service time distributions and either FIFO or priority disciplines. Numerical results are provided that show that this method is fairly accurate, even when the class aggregation technique is used.

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

[2]  K. Mani Chandy,et al.  HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems , 1982, SIGMETRICS '82.

[3]  William J. Stewart,et al.  A comparison of numerical techniques in Markov modeling , 1978, CACM.

[4]  Bruno Baynat.  Une methode approximative d'analyse des reseaux de files d'attente fermes multiclasses , 1991 .

[5]  Bruno Baynat,et al.  Approximate techniques for general closed queueing networks with subnetworks having population constraints , 1993 .

[6]  Gerardo Rubino,et al.  An approximation for a multiclass./M/1/FIFO queue imbedded in a closed Queueing Network , 1986, J. Syst. Softw..

[7]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[8]  Alexandre Brandwajn,et al.  Equivalence and Decomposition in Queueing Systems - A Unified Approach , 1985, Perform. Evaluation.

[9]  Luke Y.-C. Lien,et al.  A tree convolution algorithm for the solution of queueing networks , 1983, CACM.

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

[11]  Jeffrey R. Spirn.  Queuing Networks with Random Selection for Service , 1979, IEEE Transactions on Software Engineering.

[12]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[13]  Raymond A. Marie.  An Approximate Analytical Method for General Queueing Networks , 1979, IEEE Transactions on Software Engineering.

[14]  K. Mani Chandy,et al.  Computational algorithms for product form queueing networks , 1980 .

[15]  Raymond A. Marie,et al.  Extensions and computational aspects of an iterative method , 1982, SIGMETRICS '82.

[16]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[17]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[18]  Bruno Baynat,et al.  A Unified View of Product-Form Approximation Techniques for General Closed Queueing Networks , 1993, Perform. Evaluation.

[19]  Nicolas D. Georganas,et al.  RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks , 1986, JACM.

[20]  P BuzenJeffrey.  Computational algorithms for closed queueing networks with exponential servers , 1973 .

[21]  Steven C. Bruell,et al.  A tree-structured mean value analysis algorithm , 1986, TOCS.

[22]  Yves Dallery,et al.  Operational Analysis of Stochastic Closed Queueing Networks , 1992, Perform. Evaluation.

[23]  Yousef Saad,et al.  Numerical Methods in Markov Chain Modelling , 1996 .