Xaba: Exact, Approximate, and Asymptotic Solvers for Multi-class Closed Queueing Networks

In this paper we present a graphical software tool, Xaba, that implements exact, approximate, and asymptotic solutions for multi-class closed queueing networks with product form solution. It was specifically designed for the evaluation of complex systems with large numbers of customers of different types, starting from small populations until very large ones (e.g., tens of stations and hundreds of customers). The tool was developed for Unix systems under the X11 environment and is available for a variety of platforms. Its functionalities are illustrated via the case study of the evaluation of a corporate intranet.

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

[2]  John Zahorjan,et al.  Accuracy, Speed, and Convergence of Approximate Mean Value Analysis , 1988, Perform. Evaluation.

[3]  Satish K. Tripathi,et al.  Single-class bounds of multi-class queuing networks , 1992, JACM.

[4]  Charles Knessl,et al.  Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations , 1998, Perform. Evaluation.

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

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

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

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

[9]  Hai Wang,et al.  Experiments with Improved Approximate Mean Value Analysis Algorithms , 1998, Computer Performance Evaluation.

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

[11]  We-Min Chow.  Approximations for large scale closed queueing networks , 1983, Perform. Evaluation.

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

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

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

[15]  Elizabeth D. Zwicky,et al.  Building internet firewalls , 1995 .

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

[17]  Giuseppe Serazzi,et al.  A Queue-Shift Approximation Technique for Product-Form Queueing , 1998, Computer Performance Evaluation.

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

[19]  Giuseppe Serazzi,et al.  A Survey of Bottleneck Analysis in Closed Networks of Queues , 1993, Performance/SIGMETRICS Tutorials.