Advertisement

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

  • Paolo Cremonesi
  • Emilia Rosti
  • Giuseppe Serazzi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1786)

Abstract

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.

Keywords

Queue Length Queueing Network Customer Class First Come First Serve Queue Network Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Balbo, G. Serazzi, “Asymptotic analysis of multi-class closed queueing networks: multiple bottlenecks,” Performance Evaluation, Vol 30(3), pp 115–152, 1997.CrossRefGoogle Scholar
  2. 2.
    Y. Bard, “Some extensions to multi-class queueing network analysis,” In A. Butrimenko M. Arato, E. Gelenbe, Editors, Proc. of 4th Int. Symposium on Modeling and Performance Evaluation of Computer Systems, pp 51–62, Amsterdam, Netherlands, North-Holland Publishing Company, 1979.Google Scholar
  3. 3.
    F. Baskett, K.M. Chandy, R.R. Muntz, R. Palacios, “Open, closed and mixed networks of queues with different classes of customers,” Journal of the ACM, Vol 22(2), pp 248–260, 1975.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    J.P. Buzen, “Computational algorithms for closed queueing networks with exponential servers,” Communications of the ACM, Vol 16(9), pp 527–531, 1973.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    K.M. Chandy, D. Neuse, “Linearizer: a heuristic algorithm for queueing network models of computing systems,” Communications of the ACM, Vol 25(2), pp 126–134, 1982.CrossRefGoogle Scholar
  6. 6.
    D.B. Chapman, E.D. Zwicky, “Building Internet firewalls,” O’Reilly & Associates, Inc., 1995.Google Scholar
  7. 7.
    W.M. Chow, “Approximations for large scale closed queueing networks,” Performance Evaluation, Vol 3(1), pp 1–12, 1983.CrossRefGoogle Scholar
  8. 8.
    P. Cremonesi, P.J. Schweitzer, G. Serazzi, “A unifying framework for the approximate solution of closed multi-class queueing networks,” submitted for publication, 1999.Google Scholar
  9. 9.
    P.J. Denning, J.P. Buzen, “The operational analysis of queueing network models,” Computing Surveys, Vol 10(3), pp 225–261, September 1978.zbMATHCrossRefGoogle Scholar
  10. 10.
    L.W. Dowdy, B.M. Carlson, A.T. Krantz, S.K. Tripathi, “Single class bounds of multi-class queueing networks,” Journal of the ACM, Vol 39(1), pp 188–213, January 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    D.L. Eager, K.C. Sevcik, “Performance bound hierarchies for queueing networks,” ACM Transactions on Computer Systems, Vol 1(2), pp 99–115, 1983.CrossRefGoogle Scholar
  12. 12.
    D.L. Eager, K.C. Sevcik, “Bound hierarchies for multiple-class queueing networks,” Journal of the ACM, Vol 33(4), pp 179–206, 1986.CrossRefMathSciNetGoogle Scholar
  13. 13.
    T. Kerola, “The composite bound method for computing throughput bounds in multiple class environments,” Performance Evaluation, Vol 6(Y), pp 1–9, 1986.CrossRefMathSciNetGoogle Scholar
  14. 14.
    C. Knessl, C. Tier, “Asymptotic approximations and bottleneck analysis in product form queueing network with large populations,” Performance Evaluation, Vol 33(4), pp 219–248, 1998.CrossRefGoogle Scholar
  15. 15.
    M. Reiser, H. Kobayashi, “Queueing networks with multiple closed chains: theory and computational algorithms,” IBM Journal of Research and Development, Vol 19, pp 283–294, 1975.zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    M. Reiser, S. Lavenberg, “Mean-value analysis of closed multi-chain queueing networks,” Journal of the ACM, Vol 27(2), pp 313–322, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    P.J. Schweitzer, “Approximate analysis of multi-class closed queueing networks of queues,” Proc. of Int. Conference on Stochastic Control and Optimization, Amsterdam, April 1979.Google Scholar
  18. 18.
    P.J. Schweitzer, “A survey of mean value analysis, its generalizations, and applications, for networks of queues,” Proc. of the Second International Workshop of the Netherlands National Network for the Mathematics on Operations Research, Amsterdam, February 1991.Google Scholar
  19. 19.
    P.J. Schweitzer, G. Serazzi, M. Broglia, “A survey of bottleneck analysis in closed networks of queues,” in L. Donatiello R. Nelson Eds., Proc. of Performance evaluation of computer and communication systems. Joint tutorial papers of Performance’ 93 and Sigmetrics’ 93, LNCS 729, pp 491–508, Springer Verlag, 1993.Google Scholar
  20. 20.
    P.J. Schweitzer, G. Serazzi, M. Broglia, “A queue-shift approximation technique for product form queueing networks,” In R. Puigjaner, N. N. Savino, B. Serra Eds., Proc. of 10th Int. Conference on Modeling Techniques and Tools, pp 267–279, LNCS 1469, Springer Verlag, 1998.Google Scholar
  21. 21.
    H. Wang, K.C. Sevcik, “Experiences with improved approximate Mean Value Analysis algorithms,” In R. Puigjaner, N. N. Savino, B. Serra Eds., Proc. of 10th Int. Conference on Modeling Techniques and Tools, pp 280–291, LNCS 1469, Springer Verlag, 1998.Google Scholar
  22. 22.
  23. 23.
    J. Zahorjan, D.L. Eager, H.M. Sweillam, “Accuracy, speed and convergence of approximate mean value analysis,” Performance Evaluation, Vol 8(4), pp 255–270, 1988.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Paolo Cremonesi
    • 1
  • Emilia Rosti
    • 2
  • Giuseppe Serazzi
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di MilanoItaly
  2. 2.Dipartimento di Scienze dell’InformazioneUniversità degli Studi di MilanoItaly

Personalised recommendations