A Fixed-Point Algorithm for Closed Queueing Networks

In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and accurate in case of large numbers of nodes and large customer populations. We present the method, put it in perspective, and validate it through a large number of test scenarios. In most cases, the method provides accuracies within 5% relative error (in comparison to discrete-event simulation).

[1]  Boudewijn R. Haverkort.  Performance of computer communication systems , 1998 .

[2]  Gunter Bolch,et al.  Queueing Networks and Markov Chains - Modeling and Performance Evaluation with Computer Science Applications, Second Edition , 1998 .

[3]  Bruno Baynat,et al.  A Product-Form Approximation Method for General Closed Queueing Networks with Several Classes of Customers , 1996, Perform. Evaluation.

[4]  Ramin Sadre,et al.  Decomposition-Based Analysis of Queueing Networks , 2007 .

[5]  Ramon Puigjaner,et al.  Computer Performance Evaluation , 2000, Lecture Notes in Computer Science.

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

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

[8]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

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

[10]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[11]  Demetres D. Kouvatsos,et al.  MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-Service Blocking , 1989, Perform. Evaluation.

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

[13]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

[14]  Nicolas D. Georganas,et al.  Queueing networks - exact computational algorithms: a unified theory based on decomposition and aggregation , 1989, Computer systems.

[15]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[16]  Falko Bause,et al.  Quantitative Evaluation of Computing and Communication Systems , 1995, Lecture Notes in Computer Science.

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

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

[19]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[20]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .

[21]  Ramin Sadre,et al.  An Efficient and Accurate Decomposition Method for Open Finite-and Infinite-buffer Queueing Networks , 1999 .

[22]  Boudewijn R. Haverkort,et al.  Approximate analysis of networks of PH|PH|1|K queues with customer losses: Test results , 1998, Ann. Oper. Res..

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

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

[25]  Boudewijn R. Haverkort,et al.  Approximate Analysis of Networks of PH|PH|1|K Queues: Theory & Tool Support , 1995, MMB.

[26]  Boudewijn R. Haverkort.  QNAUT: approximately analyzing networks of PH|PH|1|K queues , 1996, Proceedings of IEEE International Computer Performance and Dependability Symposium.

[27]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

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

[29]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[30]  Ramin Sadre,et al.  FiFiQueues: Fixed-Point Analysis of Queueing Networks with Finite-Buffer Stations , 2000, Computer Performance Evaluation / TOOLS.

[31]  Gunter Bolch,et al.  Ein funktionales Konzept zur Analyse von Warteschlangennetzen und Optimierung von Leistungsgrößen , 1987, MMB.