A decomposition approximation method for multiclass BCMP queueing networks with multiple-server stations

Closed multiclass separable queueing networks can in principle be analyzed using exact computational algorithms. This, however, may not be feasible in the case of large networks. As a result, much work has been devoted to developing approximation techniques, most of which is based on heuristic extensions of the mean value analysis (MVA) algorithm. In this paper, we propose an alternative approximation method to analyze large separable networks. This method is based on an approximation method for non-separable networks recently proposed by Baynat and Dallery. We show how this method can be efficiently used to analyze large separable networks. It is especially of interest when dealing with networks having multiple-server stations. Numerical results show that this method has good accuracy.

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

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

[3]  K. Ross,et al.  Monte Carlo summation applied to multichain queueing networks , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

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

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

[6]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[7]  Edward D. Lazowska,et al.  Incorporating load dependent servers in approximate mean value analysis , 1984, SIGMETRICS '84.

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

[9]  Keith W. Ross,et al.  Algorithms to determine exact blocking probabilities for multirate tree networks , 1990, IEEE Trans. Commun..

[10]  Yonathan Bard,et al.  Some Extensions to Multiclass Queueing Network Analysis , 1979, Performance.

[11]  K. Mani Chandy,et al.  SCAT: A heuristic algorithm for queueing network models of computing systems , 1981, SIGMETRICS '81.

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

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

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

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

[16]  Edward D. Lazowska,et al.  Quantitative System Performance , 1985, Int. CMG Conference.

[17]  Ian F. Akyildiz,et al.  Mean Value Analysis Approximation for Multiple Server Queueing Networks , 1988, Perform. Evaluation.