Performance Analysis of Computing Servers using Stochastic Petri Nets and Markov Automata

Generalised Stochastic Petri Nets (GSPNs) are a widely used modeling formalism in the field of performance and dependability analysis. Their semantics and analysis is restricted to “well-defined”, i.e., confusion-free, nets. Recently, a new GSPN semantics has been defined that covers confused nets and for confusion-free nets is equivalent to the existing GSPN semantics. The key is the usage of a non-deterministic extension of CTMCs. A simple GSPN semantics results, but the question remains what kind of quantitative properties can be obtained from such expressive models. To that end, this paper studies several performance aspects of a GSPN that models a server system providing computing services so as to host the applications of diverse customers (“infrastructure as a service”). Employing this model with different parameter settings, we perform various analyses using the MaMa tool chain that supports the new GSPN semantics. We analyse the sensitivity of the GSPN model w.r.t. its major parameters –processing failure and machine suspension probabilities– by exploiting the native support of non-determinism. The case study shows that a wide range of performance metrics can still be obtained using the new semantics, albeit at the prize of requiring more resources (in particular, computation time).

[1]  Nicholas J. Dingle,et al.  Automated Customer-Centric Performance Analysis of Generalised Stochastic Petri Nets Using Tagged Tokens , 2009, Electron. Notes Theor. Comput. Sci..

[2]  Jelena V. Misic,et al.  Performance Analysis of Cloud Computing Centers Using M/G/m/m+r Queuing Systems , 2012, IEEE Transactions on Parallel and Distributed Systems.

[3]  Joost-Pieter Katoen GSPNs Revisited: Simple Semantics and New Analysis Algorithms , 2012, 2012 12th International Conference on Application of Concurrency to System Design.

[4]  Harry G. Perros,et al.  Service Performance and Analysis in Cloud Computing , 2009, 2009 Congress on Services - I.

[5]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[6]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..

[7]  Yuan-Shun Dai,et al.  Performance evaluation of cloud service considering fault recovery , 2009, The Journal of Supercomputing.

[8]  Radu Calinescu,et al.  Specification and Quantitative Analysis of Probabilistic Cloud Deployment Patterns , 2011, Haifa Verification Conference.

[9]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[10]  Lijun Zhang,et al.  A Semantics for Every GSPN , 2013, Petri Nets.

[11]  Kishor S. Trivedi,et al.  Quantifying Resiliency of IaaS Cloud , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.

[12]  Shinji Kikuchi,et al.  Performance Modeling of Concurrent Live Migration Operations in Cloud Computing Systems Using PRISM Probabilistic Model Checker , 2011, 2011 IEEE 4th International Conference on Cloud Computing.

[13]  Lijun Zhang,et al.  On Probabilistic Automata in Continuous Time , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[14]  Peter G. Harrison,et al.  Passage time distributions in large Markov chains , 2002, SIGMETRICS '02.

[15]  Joost-Pieter Katoen,et al.  Modelling, Reduction and Analysis of Markov Automata (extended version) , 2013, ArXiv.

[16]  Kishor S. Trivedi,et al.  Power-performance trade-offs in IaaS cloud: A scalable analytic approach , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks Workshops (DSN-W).

[17]  Dong Seong Kim,et al.  End-to-End Performability Analysis for Infrastructure-as-a-Service Cloud: An Interacting Stochastic Models Approach , 2010, 2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing.