Abstract
Recent years have seen a rapid growth of interest in exploiting monitoring data collected from enterprise applications for automated management and performance analysis. In spite of this trend, even simple performance inference problems involving queueing theoretic formulas often incur computational bottlenecks, for example upon computing likelihoods in models of batch systems. Motivated by this issue, we revisit the solution of multiclass closed queueing networks, which are popular models used to describe batch and distributed applications with parallelism constraints. We first prove that the normalizing constant of the equilibrium state probabilities of a closed model can be reformulated exactly as a multidimensional integral over the unit simplex. This gives as a by-product novel explicit expressions for the multiclass normalizing constant. We then derive a method based on cubature rules to efficiently evaluate the proposed integral form in small and medium-sized models. For large models, we propose novel asymptotic expansions and Monte Carlo sampling methods to efficiently and accurately approximate normalizing constants and likelihoods. We illustrate the resulting accuracy gains in problems involving optimization-based inference.
- J. Aitchison. The statistical analysis of compositional data. J. Royal Stat. Society. Series B., 139--177, 1982.Google Scholar
- J. Anselmi, P. Cremonesi. A unified framework for the bottleneck analysis of multiclass queueing networks. Perform. Eval., 67(4):218--234, 2010. Google Scholar
Digital Library
- K. E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons, 2nd ed., 1989.Google Scholar
- G. Balbo, G. Serazzi. Asymptotic analysis of multiclass closed queueing networks: Multiple bottlenecks. Perform. Eval., 30(3):115--152, 1997. Google Scholar
Digital Library
- V. Baldoni, N. Berline, J. A. De Loera, M Köppe, M. Vergne. How to integrate a polynomial over a simplex. Math. of Computation, 80(273):297--325, 2011.Google Scholar
Cross Ref
- F. Baskett, K. M. Chandy, R. R. Muntz, F. G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. JACM, 22:248--260, 1975. Google Scholar
Digital Library
- A. W. Berger, L. M. Bregman, and Y. Kogan. Bottleneck analysis in multiclass closed queueing networks and its application. QUESTA, 31(3--4):217--237, 1999. Google Scholar
Digital Library
- A. Bertozzi, J. McKenna. Multidimensional residues, generating functions, and their application to queueing networks. SIAM Review, 35(2):239--268, 1993. Google Scholar
Digital Library
- J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Comm. of the ACM, 16(9):527--531, 1973. Google Scholar
Digital Library
- G. Casale. An efficient algorithm for the exact analysis of multiclass queueing networks with large population sizes. Proc. of ACM SIGMETRICS, pp. 169--180, 2006. Google Scholar
Digital Library
- G. Casale. Exact analysis of performance models by the method of moments. Perf. Eval., 68(6):487--506, 2011. Google Scholar
Digital Library
- K. M. Chandy, U. Herzog, L. Woo. Parametric Analysis of Queueing Networks. IBM J. Res. Dev., 19(1):36--42, 1975. Google Scholar
Digital Library
- G L. Choudhury, K. K. Leung, and W. Whitt. Calculating normalization constants of closed queuing networks by numerically inverting their generating functions. JACM, 42(5):935--970, 1995. Google Scholar
Digital Library
- R. Cools. An encyclopaedia of cubature formulas. Journal of Complexity, 19:445--453, 2003. Google Scholar
Digital Library
- A. E. Conway, N. D. Georganas. RECAL - A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. JACM, 33(4):768--791, 1986. Google Scholar
Digital Library
- C. de Boor. Divided differences. Surveys in Approximation Theory, 1:46--49, 2005.Google Scholar
- I. Perezy, D. Hodge, and T. Kypraios. Auxiliary Variables for Bayesian Inference in Multi-Class Queueing Networks. arXiv:1703.03475, 9 March 2017.Google Scholar
- C. Fletcher. Innovation Insight for Algorithmic IT Operations Platforms. Gartner report G00296380, 24 March 2016.Google Scholar
- D. K. George, C. H. Xia, and M. S. Squillante. Exact-order asymptotic analysis for closed queueing networks. J. Applied Probability, 49(2):503--520, 2012.Google Scholar
Cross Ref
- A. I. Gerasimov. On normalizing constants in multiclass queueing networks. Oper. Res., 43(4):704--711, 1995. Google Scholar
Digital Library
- H. W. Gould. Some Generalizations of Vandermonde's Convolution. The American Mathematical Monthly, 63(2):84--91, 1956.Google Scholar
Cross Ref
- J. J. Gordon. The evaluation of normalizing constants in closed queueing networks. Oper. Res., 38(5):863--869, 1990. Google Scholar
Digital Library
- A. Grundmann, H.M. Möller. Invariant integration formulas for the n-simplex by combinatorial methods. SIAM Journal on Numerical Analysis, 15(2):282--290, 1978.Google Scholar
Cross Ref
- P. G. Harrison. On normalizing constants in queueing networks. Oper. Res., 33(2):464--468, 1985. Google Scholar
Digital Library
- P. G. Harrison, T. T. Lee. A new recursive algorithm for computing generating functions in closed queueing networks. In Proc. of IEEE MASCOTS, 223--230. IEEE Press, 2004. Google Scholar
Digital Library
- R. Kan. From moments of sum to moments of product. J. of Multivariate Analysis, 99(3):542--554, March 2008. Google Scholar
Digital Library
- R. E. Kass, L. Tierney, and J. B. Kadane. The validity of posterior expansions based on Laplace's method. Bayesian and likelihood methods in stat. and econ., 7:473, 1990.Google Scholar
- F. P. Kelly, L. Massoulié, and N. S. Walton. Resource pooling in congested networks: proportional fairness and product form. QUESTA, 63(1--4):165--194, 2009. Google Scholar
Digital Library
- C. Knessl, C. Tier. Asymptotic expansions for large closed queueing networks with multiple job classes. IEEE Trans. Computers, 41(4):480--488, 1992. Google Scholar
Digital Library
- C. Knessl, C. Tier. Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perf. Eval., 33(4):219--248, 1998. Google Scholar
Digital Library
- H. Kobayashi. A computational algorithm for queue distributions via the Pólya theory of enumeration. Perf. of Computer Systems, North-Holland, 1979, pp. 79--88. Google Scholar
Digital Library
- E. Koenigsberg. Cyclic queues. Operational Research Quarterly, 9, 1:22--35, 1958.Google Scholar
Cross Ref
- Y. Kogan. Asymptotic expansions for probability distributions in large loss and closed queueing networks. Perform. Eval. Rev., 29(3):25--27, Dec. 2001. Google Scholar
Digital Library
- Y. Kogan, M. Shenfild. Asymptotic solution of generalized multiclass Engset model. In Proc. of ITC, 1239--1249, 1994.Google Scholar
Cross Ref
- Y. Kogan, A. Yakovlev. Asymptotic analysis for closed multichain queueing networks with bottlenecks. QUESTA, 23:235--258, 1996.Google Scholar
- J. B. Lasserre, E. S. Zeron. A Laplace transform algorithm for the volume of a convex polytope. JACM, 48(6), 2001. Google Scholar
Digital Library
- J. McKenna, D. Mitra. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. JACM, 31(2):346--360, 1984. Google Scholar
Digital Library
- L. M. Milne-Thomson. The calculus of finite differences. Mac Millan, London, 1933.Google Scholar
- A. Asanjarani, Y. Nazarathy, P. K. Pollett. Parameter and State Estimation in Queues and Related Stochastic Models. arXiv:1701.08338, 29 Jan 2017.Google Scholar
- Y. Pawitan. In All Likelihood - Statistical Modeling and Inference Using Likelihood. Oxford Science, 2001.Google Scholar
- M. Reiser, H. Kobayashi. Queueing networks with multiple closed chains. IBM J. Res. Dev., 19(3):283--294, 1975. Google Scholar
Digital Library
- M. Reiser, S. S. Lavenberg. Mean-value analysis of closed multichain queueing networks. JACM, 27(2):312--322, 1980. Google Scholar
Digital Library
- K.W. Ross, D.H.K. Tsang and J. Wang. Monte carlo summation and integration applied to multiclass queueing networks. JACM, 41(6):1110--1135, 1994. Google Scholar
Digital Library
- P. Schweitzer. Approximate Analysis of Multiclass Closed Networks of Queues. In Proc. of the Int'l Conf. on Stoch. Control and Optim., 25--29, 1979.Google Scholar
- S. Spinner, G. Casale, F. Brosig, S. Kounev. Evaluating approaches to resource demand estimation. Perf. Eval., 92:51--71, 2015. Google Scholar
Digital Library
- C. Sutton, M. Jordan. Bayesian inference for queueing networks and modeling of internet services. Annals of Applied Stat., 5(1), 254--282, 2011.Google Scholar
Cross Ref
- W. Wang, G. Casale, C. Sutton. A Bayesian Approach to Parameter Inference in Queueing Networks. ACM TOMACS, 27(1), 2016. Google Scholar
Digital Library
Index Terms
Accelerating Performance Inference over Closed Systems by Asymptotic Methods
Recommendations
Accelerating Performance Inference over Closed Systems by Asymptotic Methods
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsRecent years have seen a rapid growth of interest in exploiting monitoring data collected from enterprise applications for automated management and performance analysis. In spite of this trend, even simple performance inference problems involving ...
Accelerating Performance Inference over Closed Systems by Asymptotic Methods
Performance evaluation reviewRecent years have seen a rapid growth of interest in exploiting monitoring data collected from enterprise applications for automated management and performance analysis. In spite of this trend, even simple performance inference problems involving ...
Study of multi server retrial queueing system under vacation policies by direct truncation method
QTNA '11: Proceedings of the 6th International Conference on Queueing Theory and Network ApplicationsConsider a Multi server Retrial queueing system with vacation policies in which arrival rate follows a Poisson distribution with parameter λ and service time follows an exponential distribution with parameter μ. Let c be the number of servers in the ...






Comments