Performance Analysis of Cloud Computing Centers Using M/G/m/m+r Queuing Systems
IEEE Transactions on Parallel and Distributed SystemsPublished 26 July 2011
Hamzeh Khazaei, Jelena Mišić, Vojislav B. Mišić
Citations388
SJR quartileQ1
SJR score2.10
SNIP2.28
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A novel approximate analytical model is described that allows cloud operators to determine the relationship between the number of servers and input buffer size and the performance indicators such as mean number of tasks in the system, blocking probability, and probability that a task will obtain immediate service.
Abstract
Successful development of cloud computing paradigm necessitates accurate performance evaluation of cloud data centers. As exact modeling of cloud centers is not feasible due to the nature of cloud centers and diversity of user requests, we describe a novel approximate analytical model for performance evaluation of cloud server farms and solve it to obtain accurate estimation of the complete probability distribution of the request response time and other important performance indicators. The model allows cloud operators to determine the relationship between the number of servers and input buffer size, on one side, and the performance indicators such as mean number of tasks in the system, blocking probability, and probability that a task will obtain immediate service, on the other.
Keywords
Computer ScienceBusiness, Management and AccountingEngineering
ACM SIGCOMM Computer Communication ReviewA break in the clouds
2,590 Citations2008Luis M. Vaquero, Luis Rodero‐Merino +2 more
The concept of Cloud Computing is discussed to achieve a complete definition of what a Cloud is, using the main characteristics typically associated with this paradigm in the literature.
Probability and Random Processes
1,858 Citations2001Geoffrey Grimmett, David Stirzaker
Journal of the Royal Statistical Society Series D (The Statistician)Comparing measures of sample skewness and kurtosis
996 Citations1998D. N. Joanes, Christine A. Gill
New Generation ComputingCloud Computing: a Perspective Study
770 Citations2010Lizhe Wang, Gregor von Laszewski +5 more
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
654 Citations2011Jason D. Baker, Chris T. Bond +8 more
Megastore provides fully serializable ACID semantics within ne-grained partitions of data, which allows us to synchronously replicate each write across a wide area network with reasonable latency and support seamless failover between datacenters.
Service Performance and Analysis in Cloud Computing
297 Citations2009Kaiqi Xiong, Harry G. Perros
In an effort to deliver QoS guaranteed services in such a computing environment, the relationship among the maximal number of customers, the minimal service resources and the highest level of services is found.
Lecture notes in computer sciencePerformance Evaluation of Cloud Service Considering Fault Recovery
157 Citations2009Bo Yang, Feng Tan +2 more
A preliminary study on the use of fault recovery in cloud service performance is conducted, quantified by service response time, whose probability density function as well as the mean is derived.
Cloud Computing Fundamentals
156 Citations2010Borko Furht
In the introductory chapter, the concept of cloud computing and cloud services are defined, and the layers and types of cloud Computing are introduced, leading to a discussion of differences between cloud Computing and cloud Services.
Journal of Applied ProbabilityApproximations in finite-capacity multi-server queues by Poisson arrivals
141 Citations1978Shirley A. Nozaki, Sheldon M. Ross
This paper considers an M/G/K queueing model having finite capacity N, a model in which customers, arriving in accordance with a Poisson process having rate lambda, enter the system if there are less than N others present when they arrive, and are serviced by one of k servers, each of whom has service distribution G.
Operations ResearchApproximations for the <i>M</i>/<i>G</i>/<i>m</i> Queue
130 Citations1978Per Hokstad
A simple approximation for the queue length distribution of the M/G/m queue with finite waiting room is proposed and some numerical results indicate that the proposed approximation is rather accurate.
Operations ResearchApproximations of the Mean Waiting Time in an <i>M</i>/<i>G</i>/<i>s</i> Queueing System
114 Citations1979Onno Boxma, J. W. Cohen +1 more
In order to obtain mean waiting time approximations it appears to be useful to introduce a quantity (the “normed cooperation coefficient”) which is inversely proportional to WGs andWhich is in some sense a measure for the “cooperation” between the servers of the service facility.
Advances in Applied ProbabilityApproximations for the steady-state probabilities in the<i>M/G/c</i>queue
98 Citations1981Henk Tijms, M. H. van Hoorn +1 more
Operations ResearchDiffusion Approximation for an <i>M</i>/<i>G</i>/<i>m</i> Queue
90 Citations1983Toshikazu Kimura
Applying the method of diffusion approximation, approximate formulas for the distributions of the number of customers, the waiting time and the busy period of the M/G/m queueing system are provided.
Performance EvaluationM/G/c/K blocking probability models and system performance
88 Citations2003J. MacGregor Smith
An approximation based on a closed- form expression derivable from the finite capacity exponential queue is presented and properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed.
Operations ResearchA Transform-Free Approximation for the Finite Capacity <i>M</i>/<i>G</i>/<i>s</i> Queue
75 Citations1996Toshikazu Kimura
A transform-free approximation for the steady-state queue-length distribution in an M/G/s queue with finite waiting spaces is developed by using a conservation law and some heuristics and it is shown that the approximation is exact for the cases with either no extra waiting space, exponential service- time distribution, or a certain two-parameter family of service-time distributions.
Journal of Applied ProbabilityApproximation of the queue-length distribution of an <i>M</i>/<i>GI</i>/<i>s</i> queue by the basic equations
58 Citations1986Masakiyo Miyazawa
A unified way of obtaining approximation formulas for the steady-state distribution of the queue length in the M/GI/s queue by considering the theoretical meaning of the assumptions given in the literature.
Operations ResearchRefining the Diffusion Approximation for the <i>M</i>/<i>G</i>/<i>m</i> Queue
55 Citations1985David D. Yao
A diffusion approximation model developed by Kimura for the M/G/m queue is refined, using an alternative approach to characterize and solve the diffusion equations and incorporating some known results of the queue into the model.
Operations ResearchApproximation of the Mean Queue Length of an <i>M/G/c</i> Queueing System
51 Citations1995N. W. Bobby, J.W. Mark
Numerical results show that the approximation is accurate even when the coefficient of variation of the service time and the number of channels of the system are as large as 20 and 200, respectively.
Journal of Applied ProbabilityCustomer average and time average queue lengths and waiting times
41 Citations1971Kneale T. Marshall, Ronald W. Wolff
Probability in the Engineering and Informational SciencesHeuristics for Finite-Buffer Queues
41 Citations1992Henk Tijms
Numerical results show an excellent performance of the heuristic, based on the equilibrium distribution of the corresponding infinite-buffer queue, which approximates the loss probability in finite-buffer queues.
Communications in Statistics Stochastic ModelsOptimal buffer design of an m/g/s queue with finite capacity<sup>∗</sup>
33 Citations1996Toshikazu Kimura
Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringPerformance Analysis of Cloud Computing Centers
18 Citations2012Hamzeh Khazaei, Jelena Mišić +1 more
An analytical model for performance evaluation of cloud server farms is described, and the manner in which important performance indicators such as request waiting time and server utilization may be assessed with sufficient accuracy is demonstrated.