MMPP/G/m/m+r Queuing System Model to Analytically Evaluate Cloud Computing Center Performances

In the last decades cloud computing has been the focus of a lot of research in both academic and industrial fields, however, implementation-related issues have been developed and have received more attention than performance analysis which is an important aspect of cloud computing and it is of crucial interest for both cloud providers and cloud users. Successful development of cloud computing paradigm necessitates accurate performance evaluation of cloud data centers. Because of the nature of cloud centers and the diversity of user requests, an exact modeling of cloud centers is not practicable; in this work we report an approximate analytical model based on an approximate Markov chain model for performance evaluation of a cloud computing center. Due to the nature of the cloud environment, we considered, based on queuing theory, a MMPP task arrivals, a general service time for requests as well as large number of physical servers and a finite capacity. This makes our model more flexible in terms of scalability and diversity of service time. We used this model in order to evaluate the performance analysis of cloud server farms and we solved it to obtain accurate estimation of the complete probability distribution of the request response time and other important performance indicators such as: the Mean number of Tasks in the System, the distribution of Waiting Time, the Probability of Immediate Service, the Blocking Probability and Buffer Size...

[1]  Toshikazu Kimura,et al.  A Transform-Free Approximation for the Finite Capacity M/G/s Queue , 1996, Oper. Res..

[2]  O. J. Boxma,et al.  Approximations of the Mean Waiting Time in an M/G/s Queueing System , 1979, Oper. Res..

[3]  Marcel F. Neuts Models Based on the Markovian Arrival Process , 1992 .

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

[5]  S. A. Nozaki,et al.  Approximations in finite-capacity multi-server queues by Poisson arrivals , 1978, Journal of Applied Probability.

[6]  E. Page,et al.  Tables of Waiting Times for M/M/n, M/D/n and D/M/n and their Use to Give Approximate Waiting Times in More General Queues , 1982 .

[7]  M. Miyazawa Approximation of the queue-length distribution of an M/GI/s queue by the basic equations , 1986, Journal of Applied Probability.

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

[9]  Borko Furht,et al.  Cloud Computing Fundamentals , 2010, Handbook of Cloud Computing.

[10]  Jon W. Mark,et al.  Approximation of the Mean Queue Length of an M/G/c Queueing System , 1995, Oper. Res..

[11]  Xi He,et al.  Cloud Computing: a Perspective Study , 2010, New Generation Computing.

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

[13]  Toshikazu Kimura Optimal buffer design of an m/g/s queue with finite capacity ∗ , 1996 .

[14]  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.

[15]  A. Federgruen,et al.  Approximations for the steady-state probabilities in the M/G/c queue , 1981, Advances in Applied Probability.

[16]  P Sarada Varma Performance Analysis of Cloud Computing under Non Homogeneous Conditions , 2013 .

[17]  Per Hokstad,et al.  Approximations for the M/G/m Queue , 1978, Oper. Res..

[18]  Huaglory Tianfield Security issues in cloud computing , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[19]  K. T. Marshall,et al.  Customer average and time average queue lengths and waiting times , 1971 .

[20]  Yukio Takahashi AN APPROXIMATION FORMULA FOR THE MEAN WAITING TIME OF AN M/G/c QUEUE , 1977 .